java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec3_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:20:14,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:20:14,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:20:14,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:20:14,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:20:14,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:20:14,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:20:14,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:20:14,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:20:14,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:20:14,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:20:14,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:20:14,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:20:14,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:20:14,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:20:14,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:20:14,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:20:14,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:20:14,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:20:14,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:20:14,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:20:14,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:20:14,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:20:14,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:20:14,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:20:14,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:20:14,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:20:14,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:20:14,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:20:14,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:20:14,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:20:14,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:20:14,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:20:14,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:20:14,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:20:14,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:20:14,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:20:14,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:20:14,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:20:14,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:20:14,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:20:14,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:20:14,598 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:20:14,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:20:14,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:20:14,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:20:14,602 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:20:14,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:20:14,603 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:20:14,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:20:14,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:20:14,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:20:14,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:20:14,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:20:14,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:20:14,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:20:14,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:20:14,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:20:14,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:20:14,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:20:14,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:20:14,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:20:14,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:20:14,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:20:14,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:20:14,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:20:14,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:20:14,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:20:14,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:20:14,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:20:14,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:20:14,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:20:14,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:20:14,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:20:14,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:20:14,678 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:20:14,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product28.cil.c [2019-10-02 13:20:14,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac17c0e3/d2586bd047fd4553b3bebc88fe02d02f/FLAG6a4c72f7a [2019-10-02 13:20:15,441 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:20:15,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product28.cil.c [2019-10-02 13:20:15,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac17c0e3/d2586bd047fd4553b3bebc88fe02d02f/FLAG6a4c72f7a [2019-10-02 13:20:15,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac17c0e3/d2586bd047fd4553b3bebc88fe02d02f [2019-10-02 13:20:15,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:20:15,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:20:15,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:20:15,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:20:15,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:20:15,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:15" (1/1) ... [2019-10-02 13:20:15,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6228bf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:15, skipping insertion in model container [2019-10-02 13:20:15,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:15" (1/1) ... [2019-10-02 13:20:15,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:20:15,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:20:16,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:20:16,402 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:20:16,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:20:16,677 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:20:16,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16 WrapperNode [2019-10-02 13:20:16,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:20:16,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:20:16,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:20:16,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:20:16,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... [2019-10-02 13:20:16,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:20:16,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:20:16,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:20:16,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:20:16,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:20:16,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:20:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:20:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:20:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:20:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 13:20:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:20:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:20:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:20:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:20:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:20:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:20:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:20:16,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:20:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:20:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:20:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:20:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:20:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:20:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:20:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:20:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:20:16,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:20:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:20:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:20:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:20:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:20:16,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:20:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:20:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:20:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:20:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:20:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:20:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:20:16,948 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:20:16,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:20:16,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:20:16,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:20:16,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:20:16,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:20:16,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:20:16,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:20:16,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:20:16,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:20:16,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:20:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:20:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:20:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:20:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:20:16,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:20:16,952 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:20:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:20:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:20:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:20:16,953 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:20:16,954 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:20:16,955 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:20:16,955 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:20:16,955 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:20:16,955 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:20:16,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:20:16,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:20:16,957 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:20:16,958 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:20:16,959 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:20:16,960 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:20:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:20:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:20:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:20:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:20:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:20:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:20:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:20:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:20:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:20:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:20:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:20:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:20:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:20:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:20:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:20:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:20:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:20:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:20:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:20:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:20:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:20:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:20:16,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:20:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:20:16,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:20:19,341 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:20:19,341 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:20:19,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:19 BoogieIcfgContainer [2019-10-02 13:20:19,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:20:19,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:20:19,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:20:19,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:20:19,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:20:15" (1/3) ... [2019-10-02 13:20:19,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1525e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:19, skipping insertion in model container [2019-10-02 13:20:19,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:16" (2/3) ... [2019-10-02 13:20:19,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1525e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:19, skipping insertion in model container [2019-10-02 13:20:19,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:19" (3/3) ... [2019-10-02 13:20:19,352 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product28.cil.c [2019-10-02 13:20:19,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:20:19,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:20:19,391 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:20:19,436 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:20:19,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:20:19,437 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:20:19,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:20:19,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:20:19,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:20:19,437 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:20:19,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:20:19,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:20:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states. [2019-10-02 13:20:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:20:19,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:19,492 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:19,494 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1535758530, now seen corresponding path program 1 times [2019-10-02 13:20:19,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:19,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:19,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:19,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:20:20,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:20:20,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:20:20,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:20:20,199 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 2 states. [2019-10-02 13:20:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:20,313 INFO L93 Difference]: Finished difference Result 739 states and 985 transitions. [2019-10-02 13:20:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:20:20,315 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-02 13:20:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:20,355 INFO L225 Difference]: With dead ends: 739 [2019-10-02 13:20:20,355 INFO L226 Difference]: Without dead ends: 470 [2019-10-02 13:20:20,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:20:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-02 13:20:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-10-02 13:20:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-02 13:20:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 627 transitions. [2019-10-02 13:20:20,452 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 627 transitions. Word has length 195 [2019-10-02 13:20:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:20,454 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 627 transitions. [2019-10-02 13:20:20,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:20:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 627 transitions. [2019-10-02 13:20:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:20:20,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:20,463 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:20,463 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1501610490, now seen corresponding path program 1 times [2019-10-02 13:20:20,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:20,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:20,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:20,769 INFO L87 Difference]: Start difference. First operand 470 states and 627 transitions. Second operand 3 states. [2019-10-02 13:20:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:20,842 INFO L93 Difference]: Finished difference Result 722 states and 948 transitions. [2019-10-02 13:20:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:20,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:20:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:20,848 INFO L225 Difference]: With dead ends: 722 [2019-10-02 13:20:20,848 INFO L226 Difference]: Without dead ends: 473 [2019-10-02 13:20:20,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:20,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-02 13:20:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-10-02 13:20:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-02 13:20:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 629 transitions. [2019-10-02 13:20:20,914 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 629 transitions. Word has length 196 [2019-10-02 13:20:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:20,916 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 629 transitions. [2019-10-02 13:20:20,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 629 transitions. [2019-10-02 13:20:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:20:20,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:20,922 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:20,923 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1703734010, now seen corresponding path program 1 times [2019-10-02 13:20:20,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:20,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:20,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:20:21,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:20:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:20:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:21,200 INFO L87 Difference]: Start difference. First operand 472 states and 629 transitions. Second operand 3 states. [2019-10-02 13:20:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:21,255 INFO L93 Difference]: Finished difference Result 918 states and 1253 transitions. [2019-10-02 13:20:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:20:21,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-02 13:20:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:21,264 INFO L225 Difference]: With dead ends: 918 [2019-10-02 13:20:21,265 INFO L226 Difference]: Without dead ends: 511 [2019-10-02 13:20:21,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:20:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-02 13:20:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 510. [2019-10-02 13:20:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 13:20:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 695 transitions. [2019-10-02 13:20:21,318 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 695 transitions. Word has length 202 [2019-10-02 13:20:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:21,322 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 695 transitions. [2019-10-02 13:20:21,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:20:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 695 transitions. [2019-10-02 13:20:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:20:21,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:21,336 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:21,336 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -940076344, now seen corresponding path program 1 times [2019-10-02 13:20:21,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:20:21,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:21,985 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:20:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:22,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 2708 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:20:22,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:20:22,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:22,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:20:22,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:20:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:20:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:20:22,962 INFO L87 Difference]: Start difference. First operand 510 states and 695 transitions. Second operand 26 states. [2019-10-02 13:20:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:31,581 INFO L93 Difference]: Finished difference Result 2003 states and 2762 transitions. [2019-10-02 13:20:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 13:20:31,582 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 203 [2019-10-02 13:20:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:31,596 INFO L225 Difference]: With dead ends: 2003 [2019-10-02 13:20:31,597 INFO L226 Difference]: Without dead ends: 1529 [2019-10-02 13:20:31,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=496, Invalid=4616, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 13:20:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-10-02 13:20:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1494. [2019-10-02 13:20:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-10-02 13:20:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2042 transitions. [2019-10-02 13:20:31,727 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2042 transitions. Word has length 203 [2019-10-02 13:20:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:31,727 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2042 transitions. [2019-10-02 13:20:31,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:20:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2042 transitions. [2019-10-02 13:20:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:20:31,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:31,734 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:31,735 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:31,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:31,735 INFO L82 PathProgramCache]: Analyzing trace with hash -781028512, now seen corresponding path program 1 times [2019-10-02 13:20:31,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:31,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:20:32,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:32,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:20:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:20:32,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:20:32,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:32,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:20:32,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:20:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:20:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:20:32,864 INFO L87 Difference]: Start difference. First operand 1494 states and 2042 transitions. Second operand 20 states. [2019-10-02 13:20:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:39,687 INFO L93 Difference]: Finished difference Result 3040 states and 4210 transitions. [2019-10-02 13:20:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 13:20:39,695 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 205 [2019-10-02 13:20:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:39,704 INFO L225 Difference]: With dead ends: 3040 [2019-10-02 13:20:39,705 INFO L226 Difference]: Without dead ends: 1597 [2019-10-02 13:20:39,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=423, Invalid=3483, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 13:20:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2019-10-02 13:20:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1557. [2019-10-02 13:20:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-02 13:20:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2142 transitions. [2019-10-02 13:20:39,788 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2142 transitions. Word has length 205 [2019-10-02 13:20:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:39,788 INFO L475 AbstractCegarLoop]: Abstraction has 1557 states and 2142 transitions. [2019-10-02 13:20:39,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:20:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2142 transitions. [2019-10-02 13:20:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:20:39,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:39,795 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:39,796 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:39,796 INFO L82 PathProgramCache]: Analyzing trace with hash 223610082, now seen corresponding path program 1 times [2019-10-02 13:20:39,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:39,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:20:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:20:39,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:20:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:20:39,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:20:39,954 INFO L87 Difference]: Start difference. First operand 1557 states and 2142 transitions. Second operand 5 states. [2019-10-02 13:20:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:40,026 INFO L93 Difference]: Finished difference Result 1861 states and 2551 transitions. [2019-10-02 13:20:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:20:40,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-10-02 13:20:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:40,035 INFO L225 Difference]: With dead ends: 1861 [2019-10-02 13:20:40,035 INFO L226 Difference]: Without dead ends: 1271 [2019-10-02 13:20:40,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:20:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-10-02 13:20:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2019-10-02 13:20:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-10-02 13:20:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1759 transitions. [2019-10-02 13:20:40,106 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1759 transitions. Word has length 208 [2019-10-02 13:20:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:40,108 INFO L475 AbstractCegarLoop]: Abstraction has 1271 states and 1759 transitions. [2019-10-02 13:20:40,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:20:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1759 transitions. [2019-10-02 13:20:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:20:40,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:40,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:40,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -375940993, now seen corresponding path program 1 times [2019-10-02 13:20:40,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:40,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:20:40,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:40,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:20:40,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:20:40,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:20:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:20:40,440 INFO L87 Difference]: Start difference. First operand 1271 states and 1759 transitions. Second operand 16 states. [2019-10-02 13:20:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:40,785 INFO L93 Difference]: Finished difference Result 2116 states and 2889 transitions. [2019-10-02 13:20:40,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:20:40,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 206 [2019-10-02 13:20:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:40,794 INFO L225 Difference]: With dead ends: 2116 [2019-10-02 13:20:40,795 INFO L226 Difference]: Without dead ends: 1331 [2019-10-02 13:20:40,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:20:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-10-02 13:20:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1311. [2019-10-02 13:20:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-10-02 13:20:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1814 transitions. [2019-10-02 13:20:40,886 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1814 transitions. Word has length 206 [2019-10-02 13:20:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:40,887 INFO L475 AbstractCegarLoop]: Abstraction has 1311 states and 1814 transitions. [2019-10-02 13:20:40,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:20:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1814 transitions. [2019-10-02 13:20:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:20:40,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:40,893 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:40,893 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1207974712, now seen corresponding path program 1 times [2019-10-02 13:20:40,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:40,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:40,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:40,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:20:41,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:20:41,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:20:41,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:41,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 2711 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:20:41,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:20:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:20:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:20:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:20:41,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:20:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:20:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:20:41,889 INFO L87 Difference]: Start difference. First operand 1311 states and 1814 transitions. Second operand 12 states. [2019-10-02 13:20:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:45,225 INFO L93 Difference]: Finished difference Result 4114 states and 5743 transitions. [2019-10-02 13:20:45,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:20:45,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2019-10-02 13:20:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:45,244 INFO L225 Difference]: With dead ends: 4114 [2019-10-02 13:20:45,244 INFO L226 Difference]: Without dead ends: 2864 [2019-10-02 13:20:45,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:20:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-10-02 13:20:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2833. [2019-10-02 13:20:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-10-02 13:20:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3917 transitions. [2019-10-02 13:20:45,420 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3917 transitions. Word has length 206 [2019-10-02 13:20:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:45,423 INFO L475 AbstractCegarLoop]: Abstraction has 2833 states and 3917 transitions. [2019-10-02 13:20:45,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:20:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3917 transitions. [2019-10-02 13:20:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:20:45,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:45,432 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:45,432 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1105182420, now seen corresponding path program 1 times [2019-10-02 13:20:45,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:45,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:20:45,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:45,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:20:45,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:20:45,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:20:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:20:45,829 INFO L87 Difference]: Start difference. First operand 2833 states and 3917 transitions. Second operand 12 states. [2019-10-02 13:20:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:55,771 INFO L93 Difference]: Finished difference Result 17934 states and 23919 transitions. [2019-10-02 13:20:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:20:55,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 207 [2019-10-02 13:20:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:55,865 INFO L225 Difference]: With dead ends: 17934 [2019-10-02 13:20:55,866 INFO L226 Difference]: Without dead ends: 14389 [2019-10-02 13:20:55,964 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:20:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14389 states. [2019-10-02 13:20:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14389 to 13638. [2019-10-02 13:20:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13638 states. [2019-10-02 13:20:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13638 states to 13638 states and 18109 transitions. [2019-10-02 13:20:56,621 INFO L78 Accepts]: Start accepts. Automaton has 13638 states and 18109 transitions. Word has length 207 [2019-10-02 13:20:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:56,623 INFO L475 AbstractCegarLoop]: Abstraction has 13638 states and 18109 transitions. [2019-10-02 13:20:56,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:20:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13638 states and 18109 transitions. [2019-10-02 13:20:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:20:56,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:56,634 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:56,634 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash 464365979, now seen corresponding path program 1 times [2019-10-02 13:20:56,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:56,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:20:56,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:56,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:20:56,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:20:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:20:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:20:56,944 INFO L87 Difference]: Start difference. First operand 13638 states and 18109 transitions. Second operand 18 states. [2019-10-02 13:20:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:57,516 INFO L93 Difference]: Finished difference Result 22561 states and 29800 transitions. [2019-10-02 13:20:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:20:57,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 208 [2019-10-02 13:20:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:57,561 INFO L225 Difference]: With dead ends: 22561 [2019-10-02 13:20:57,561 INFO L226 Difference]: Without dead ends: 9693 [2019-10-02 13:20:57,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:20:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9693 states. [2019-10-02 13:20:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9693 to 8741. [2019-10-02 13:20:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2019-10-02 13:20:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 11673 transitions. [2019-10-02 13:20:58,105 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 11673 transitions. Word has length 208 [2019-10-02 13:20:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:20:58,106 INFO L475 AbstractCegarLoop]: Abstraction has 8741 states and 11673 transitions. [2019-10-02 13:20:58,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:20:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 11673 transitions. [2019-10-02 13:20:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:20:58,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:20:58,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:20:58,115 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:20:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:20:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1620000784, now seen corresponding path program 1 times [2019-10-02 13:20:58,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:20:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:20:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:58,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:20:58,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:20:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:20:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:20:58,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:20:58,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:20:58,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:20:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:20:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:20:58,302 INFO L87 Difference]: Start difference. First operand 8741 states and 11673 transitions. Second operand 8 states. [2019-10-02 13:20:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:59,454 INFO L93 Difference]: Finished difference Result 23737 states and 31575 transitions. [2019-10-02 13:20:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:20:59,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 217 [2019-10-02 13:20:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:59,540 INFO L225 Difference]: With dead ends: 23737 [2019-10-02 13:20:59,540 INFO L226 Difference]: Without dead ends: 17321 [2019-10-02 13:20:59,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:20:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17321 states. [2019-10-02 13:21:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17321 to 16850. [2019-10-02 13:21:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16850 states. [2019-10-02 13:21:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16850 states to 16850 states and 22431 transitions. [2019-10-02 13:21:00,908 INFO L78 Accepts]: Start accepts. Automaton has 16850 states and 22431 transitions. Word has length 217 [2019-10-02 13:21:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:00,909 INFO L475 AbstractCegarLoop]: Abstraction has 16850 states and 22431 transitions. [2019-10-02 13:21:00,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:21:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 16850 states and 22431 transitions. [2019-10-02 13:21:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:21:00,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:00,922 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:00,922 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash 175512629, now seen corresponding path program 1 times [2019-10-02 13:21:00,923 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:00,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:21:01,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:01,162 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:01,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:01,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:01,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:21:01,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:21:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:21:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:21:01,922 INFO L87 Difference]: Start difference. First operand 16850 states and 22431 transitions. Second operand 22 states. [2019-10-02 13:21:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:08,314 INFO L93 Difference]: Finished difference Result 34643 states and 46378 transitions. [2019-10-02 13:21:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 13:21:08,314 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 218 [2019-10-02 13:21:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:08,392 INFO L225 Difference]: With dead ends: 34643 [2019-10-02 13:21:08,392 INFO L226 Difference]: Without dead ends: 17868 [2019-10-02 13:21:08,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=2725, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:21:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17868 states. [2019-10-02 13:21:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17868 to 16817. [2019-10-02 13:21:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16817 states. [2019-10-02 13:21:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 22389 transitions. [2019-10-02 13:21:09,341 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 22389 transitions. Word has length 218 [2019-10-02 13:21:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:09,342 INFO L475 AbstractCegarLoop]: Abstraction has 16817 states and 22389 transitions. [2019-10-02 13:21:09,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:21:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 22389 transitions. [2019-10-02 13:21:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 13:21:09,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:09,354 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:09,354 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 478098380, now seen corresponding path program 1 times [2019-10-02 13:21:09,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:21:09,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:09,789 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:09,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:10,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:21:10,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:10,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:21:10,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:21:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:21:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:21:10,517 INFO L87 Difference]: Start difference. First operand 16817 states and 22389 transitions. Second operand 30 states. [2019-10-02 13:21:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:18,416 INFO L93 Difference]: Finished difference Result 35074 states and 47018 transitions. [2019-10-02 13:21:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 13:21:18,416 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 219 [2019-10-02 13:21:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:18,478 INFO L225 Difference]: With dead ends: 35074 [2019-10-02 13:21:18,478 INFO L226 Difference]: Without dead ends: 18045 [2019-10-02 13:21:18,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=4349, Unknown=0, NotChecked=0, Total=4830 [2019-10-02 13:21:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18045 states. [2019-10-02 13:21:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18045 to 17188. [2019-10-02 13:21:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17188 states. [2019-10-02 13:21:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17188 states to 17188 states and 22898 transitions. [2019-10-02 13:21:19,118 INFO L78 Accepts]: Start accepts. Automaton has 17188 states and 22898 transitions. Word has length 219 [2019-10-02 13:21:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:19,119 INFO L475 AbstractCegarLoop]: Abstraction has 17188 states and 22898 transitions. [2019-10-02 13:21:19,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:21:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17188 states and 22898 transitions. [2019-10-02 13:21:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:21:19,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:19,130 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:19,131 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash -689731388, now seen corresponding path program 1 times [2019-10-02 13:21:19,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:19,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:19,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:21:19,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:19,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:21:19,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:21:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:21:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:21:19,344 INFO L87 Difference]: Start difference. First operand 17188 states and 22898 transitions. Second operand 13 states. [2019-10-02 13:21:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:20,374 INFO L93 Difference]: Finished difference Result 26801 states and 36214 transitions. [2019-10-02 13:21:20,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:21:20,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 220 [2019-10-02 13:21:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:20,467 INFO L225 Difference]: With dead ends: 26801 [2019-10-02 13:21:20,467 INFO L226 Difference]: Without dead ends: 19246 [2019-10-02 13:21:20,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19246 states. [2019-10-02 13:21:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19246 to 18228. [2019-10-02 13:21:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18228 states. [2019-10-02 13:21:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18228 states to 18228 states and 24538 transitions. [2019-10-02 13:21:22,193 INFO L78 Accepts]: Start accepts. Automaton has 18228 states and 24538 transitions. Word has length 220 [2019-10-02 13:21:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:22,194 INFO L475 AbstractCegarLoop]: Abstraction has 18228 states and 24538 transitions. [2019-10-02 13:21:22,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:21:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18228 states and 24538 transitions. [2019-10-02 13:21:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 13:21:22,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:22,211 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:22,212 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1292033382, now seen corresponding path program 2 times [2019-10-02 13:21:22,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:22,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:22,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:22,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:21:23,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:21:23,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:21:23,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 2757 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:21:23,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:21:23,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:21:23,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:21:23,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:21:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:21:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:23,811 INFO L87 Difference]: Start difference. First operand 18228 states and 24538 transitions. Second operand 18 states. [2019-10-02 13:21:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:32,817 INFO L93 Difference]: Finished difference Result 47839 states and 64563 transitions. [2019-10-02 13:21:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:21:32,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2019-10-02 13:21:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:32,946 INFO L225 Difference]: With dead ends: 47839 [2019-10-02 13:21:32,946 INFO L226 Difference]: Without dead ends: 30034 [2019-10-02 13:21:32,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:21:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30034 states. [2019-10-02 13:21:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30034 to 25518. [2019-10-02 13:21:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25518 states. [2019-10-02 13:21:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25518 states to 25518 states and 34137 transitions. [2019-10-02 13:21:35,221 INFO L78 Accepts]: Start accepts. Automaton has 25518 states and 34137 transitions. Word has length 220 [2019-10-02 13:21:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:35,221 INFO L475 AbstractCegarLoop]: Abstraction has 25518 states and 34137 transitions. [2019-10-02 13:21:35,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:21:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25518 states and 34137 transitions. [2019-10-02 13:21:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:21:35,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:35,236 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:35,237 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash 127250932, now seen corresponding path program 1 times [2019-10-02 13:21:35,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:35,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:21:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:21:35,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:35,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:21:35,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:21:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:21:35,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:21:35,469 INFO L87 Difference]: Start difference. First operand 25518 states and 34137 transitions. Second operand 13 states. [2019-10-02 13:21:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:36,364 INFO L93 Difference]: Finished difference Result 37840 states and 51496 transitions. [2019-10-02 13:21:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:21:36,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 221 [2019-10-02 13:21:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:36,461 INFO L225 Difference]: With dead ends: 37840 [2019-10-02 13:21:36,462 INFO L226 Difference]: Without dead ends: 28602 [2019-10-02 13:21:36,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28602 states. [2019-10-02 13:21:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28602 to 26327. [2019-10-02 13:21:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26327 states. [2019-10-02 13:21:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26327 states to 26327 states and 35520 transitions. [2019-10-02 13:21:37,745 INFO L78 Accepts]: Start accepts. Automaton has 26327 states and 35520 transitions. Word has length 221 [2019-10-02 13:21:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:37,746 INFO L475 AbstractCegarLoop]: Abstraction has 26327 states and 35520 transitions. [2019-10-02 13:21:37,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:21:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 26327 states and 35520 transitions. [2019-10-02 13:21:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:21:37,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:37,758 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:37,758 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:37,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1722839133, now seen corresponding path program 1 times [2019-10-02 13:21:37,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:37,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:37,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:21:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:38,269 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:38,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:38,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:21:38,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:21:38,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:38,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 28 [2019-10-02 13:21:38,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 13:21:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 13:21:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:21:38,960 INFO L87 Difference]: Start difference. First operand 26327 states and 35520 transitions. Second operand 28 states. [2019-10-02 13:21:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:45,745 INFO L93 Difference]: Finished difference Result 53249 states and 71838 transitions. [2019-10-02 13:21:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:21:45,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 221 [2019-10-02 13:21:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:45,852 INFO L225 Difference]: With dead ends: 53249 [2019-10-02 13:21:45,852 INFO L226 Difference]: Without dead ends: 27044 [2019-10-02 13:21:45,920 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=2737, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:21:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27044 states. [2019-10-02 13:21:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27044 to 26368. [2019-10-02 13:21:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26368 states. [2019-10-02 13:21:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26368 states to 26368 states and 35571 transitions. [2019-10-02 13:21:47,387 INFO L78 Accepts]: Start accepts. Automaton has 26368 states and 35571 transitions. Word has length 221 [2019-10-02 13:21:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:47,388 INFO L475 AbstractCegarLoop]: Abstraction has 26368 states and 35571 transitions. [2019-10-02 13:21:47,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 13:21:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26368 states and 35571 transitions. [2019-10-02 13:21:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:21:47,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:47,399 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:47,400 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash 635944105, now seen corresponding path program 1 times [2019-10-02 13:21:47,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:47,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:47,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:21:47,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:47,760 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:21:47,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:48,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 2757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:21:48,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:48,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:21:48,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4] total 19 [2019-10-02 13:21:48,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:21:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:21:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:21:48,386 INFO L87 Difference]: Start difference. First operand 26368 states and 35571 transitions. Second operand 19 states. [2019-10-02 13:21:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:51,845 INFO L93 Difference]: Finished difference Result 43548 states and 58840 transitions. [2019-10-02 13:21:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 13:21:51,846 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 222 [2019-10-02 13:21:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:51,905 INFO L225 Difference]: With dead ends: 43548 [2019-10-02 13:21:51,905 INFO L226 Difference]: Without dead ends: 18526 [2019-10-02 13:21:51,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:21:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18526 states. [2019-10-02 13:21:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18526 to 17699. [2019-10-02 13:21:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17699 states. [2019-10-02 13:21:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17699 states to 17699 states and 24116 transitions. [2019-10-02 13:21:53,953 INFO L78 Accepts]: Start accepts. Automaton has 17699 states and 24116 transitions. Word has length 222 [2019-10-02 13:21:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:53,953 INFO L475 AbstractCegarLoop]: Abstraction has 17699 states and 24116 transitions. [2019-10-02 13:21:53,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:21:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17699 states and 24116 transitions. [2019-10-02 13:21:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:21:53,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:53,965 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:53,965 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1676490708, now seen corresponding path program 1 times [2019-10-02 13:21:53,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:53,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:54,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:54,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:54,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:54,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:54,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:54,087 INFO L87 Difference]: Start difference. First operand 17699 states and 24116 transitions. Second operand 3 states. [2019-10-02 13:21:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:54,881 INFO L93 Difference]: Finished difference Result 35700 states and 48924 transitions. [2019-10-02 13:21:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:54,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-10-02 13:21:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:54,929 INFO L225 Difference]: With dead ends: 35700 [2019-10-02 13:21:54,929 INFO L226 Difference]: Without dead ends: 18171 [2019-10-02 13:21:54,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2019-10-02 13:21:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 17994. [2019-10-02 13:21:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17994 states. [2019-10-02 13:21:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17994 states to 17994 states and 24759 transitions. [2019-10-02 13:21:55,557 INFO L78 Accepts]: Start accepts. Automaton has 17994 states and 24759 transitions. Word has length 228 [2019-10-02 13:21:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:55,557 INFO L475 AbstractCegarLoop]: Abstraction has 17994 states and 24759 transitions. [2019-10-02 13:21:55,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17994 states and 24759 transitions. [2019-10-02 13:21:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:21:55,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:55,567 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:55,567 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash -710083635, now seen corresponding path program 1 times [2019-10-02 13:21:55,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:55,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:55,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:55,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:21:55,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:21:55,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:21:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:21:55,706 INFO L87 Difference]: Start difference. First operand 17994 states and 24759 transitions. Second operand 6 states. [2019-10-02 13:21:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:56,224 INFO L93 Difference]: Finished difference Result 35728 states and 49160 transitions. [2019-10-02 13:21:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:21:56,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 13:21:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:56,262 INFO L225 Difference]: With dead ends: 35728 [2019-10-02 13:21:56,263 INFO L226 Difference]: Without dead ends: 18000 [2019-10-02 13:21:56,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:21:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18000 states. [2019-10-02 13:21:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18000 to 17566. [2019-10-02 13:21:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17566 states. [2019-10-02 13:21:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17566 states to 17566 states and 24179 transitions. [2019-10-02 13:21:57,062 INFO L78 Accepts]: Start accepts. Automaton has 17566 states and 24179 transitions. Word has length 229 [2019-10-02 13:21:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:57,062 INFO L475 AbstractCegarLoop]: Abstraction has 17566 states and 24179 transitions. [2019-10-02 13:21:57,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:21:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17566 states and 24179 transitions. [2019-10-02 13:21:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:21:57,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:57,072 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:57,072 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1433318174, now seen corresponding path program 1 times [2019-10-02 13:21:57,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:57,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:57,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:57,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:57,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:57,191 INFO L87 Difference]: Start difference. First operand 17566 states and 24179 transitions. Second operand 3 states. [2019-10-02 13:21:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:57,658 INFO L93 Difference]: Finished difference Result 35824 states and 49796 transitions. [2019-10-02 13:21:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:57,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-02 13:21:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:57,698 INFO L225 Difference]: With dead ends: 35824 [2019-10-02 13:21:57,698 INFO L226 Difference]: Without dead ends: 18440 [2019-10-02 13:21:57,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-10-02 13:21:58,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18434. [2019-10-02 13:21:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18434 states. [2019-10-02 13:21:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18434 states to 18434 states and 25801 transitions. [2019-10-02 13:21:58,330 INFO L78 Accepts]: Start accepts. Automaton has 18434 states and 25801 transitions. Word has length 229 [2019-10-02 13:21:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:58,331 INFO L475 AbstractCegarLoop]: Abstraction has 18434 states and 25801 transitions. [2019-10-02 13:21:58,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 18434 states and 25801 transitions. [2019-10-02 13:21:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:21:58,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:58,342 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:58,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1304082742, now seen corresponding path program 1 times [2019-10-02 13:21:58,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:58,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:58,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:58,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:58,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:58,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:58,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:58,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:58,460 INFO L87 Difference]: Start difference. First operand 18434 states and 25801 transitions. Second operand 3 states. [2019-10-02 13:21:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:59,180 INFO L93 Difference]: Finished difference Result 38344 states and 54476 transitions. [2019-10-02 13:21:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:59,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 13:21:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:59,220 INFO L225 Difference]: With dead ends: 38344 [2019-10-02 13:21:59,220 INFO L226 Difference]: Without dead ends: 20108 [2019-10-02 13:21:59,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20108 states. [2019-10-02 13:21:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20108 to 20102. [2019-10-02 13:21:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2019-10-02 13:21:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 28859 transitions. [2019-10-02 13:21:59,921 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 28859 transitions. Word has length 230 [2019-10-02 13:21:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:59,921 INFO L475 AbstractCegarLoop]: Abstraction has 20102 states and 28859 transitions. [2019-10-02 13:21:59,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 28859 transitions. [2019-10-02 13:21:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:21:59,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:59,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:59,943 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 557841982, now seen corresponding path program 1 times [2019-10-02 13:21:59,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:59,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:59,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:59,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:59,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:00,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:00,059 INFO L87 Difference]: Start difference. First operand 20102 states and 28859 transitions. Second operand 3 states. [2019-10-02 13:22:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:00,706 INFO L93 Difference]: Finished difference Result 43168 states and 63320 transitions. [2019-10-02 13:22:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:00,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:22:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:00,762 INFO L225 Difference]: With dead ends: 43168 [2019-10-02 13:22:00,762 INFO L226 Difference]: Without dead ends: 23288 [2019-10-02 13:22:00,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23288 states. [2019-10-02 13:22:01,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23288 to 23282. [2019-10-02 13:22:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23282 states. [2019-10-02 13:22:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23282 states to 23282 states and 34629 transitions. [2019-10-02 13:22:01,966 INFO L78 Accepts]: Start accepts. Automaton has 23282 states and 34629 transitions. Word has length 231 [2019-10-02 13:22:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:01,966 INFO L475 AbstractCegarLoop]: Abstraction has 23282 states and 34629 transitions. [2019-10-02 13:22:01,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 23282 states and 34629 transitions. [2019-10-02 13:22:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:22:02,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:02,001 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:02,001 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1083976618, now seen corresponding path program 1 times [2019-10-02 13:22:02,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:02,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:02,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:02,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:02,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:02,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:02,122 INFO L87 Difference]: Start difference. First operand 23282 states and 34629 transitions. Second operand 3 states. [2019-10-02 13:22:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:03,013 INFO L93 Difference]: Finished difference Result 52768 states and 80786 transitions. [2019-10-02 13:22:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:03,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:22:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:03,082 INFO L225 Difference]: With dead ends: 52768 [2019-10-02 13:22:03,082 INFO L226 Difference]: Without dead ends: 29724 [2019-10-02 13:22:03,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29724 states. [2019-10-02 13:22:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29724 to 29718. [2019-10-02 13:22:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29718 states. [2019-10-02 13:22:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29718 states to 29718 states and 46247 transitions. [2019-10-02 13:22:04,207 INFO L78 Accepts]: Start accepts. Automaton has 29718 states and 46247 transitions. Word has length 232 [2019-10-02 13:22:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:04,208 INFO L475 AbstractCegarLoop]: Abstraction has 29718 states and 46247 transitions. [2019-10-02 13:22:04,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29718 states and 46247 transitions. [2019-10-02 13:22:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:22:04,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:04,254 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:04,254 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1555917150, now seen corresponding path program 1 times [2019-10-02 13:22:04,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:04,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:04,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:04,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:04,365 INFO L87 Difference]: Start difference. First operand 29718 states and 46247 transitions. Second operand 3 states. [2019-10-02 13:22:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:05,831 INFO L93 Difference]: Finished difference Result 71100 states and 113700 transitions. [2019-10-02 13:22:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:05,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:22:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:05,958 INFO L225 Difference]: With dead ends: 71100 [2019-10-02 13:22:05,958 INFO L226 Difference]: Without dead ends: 41632 [2019-10-02 13:22:06,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41632 states. [2019-10-02 13:22:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41632 to 41626. [2019-10-02 13:22:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41626 states. [2019-10-02 13:22:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41626 states to 41626 states and 67369 transitions. [2019-10-02 13:22:09,448 INFO L78 Accepts]: Start accepts. Automaton has 41626 states and 67369 transitions. Word has length 233 [2019-10-02 13:22:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:09,449 INFO L475 AbstractCegarLoop]: Abstraction has 41626 states and 67369 transitions. [2019-10-02 13:22:09,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41626 states and 67369 transitions. [2019-10-02 13:22:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 13:22:09,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:09,602 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:09,602 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash -87084084, now seen corresponding path program 1 times [2019-10-02 13:22:09,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:09,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:09,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:22:10,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:10,154 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:22:10,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:10,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 2823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:22:10,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 13:22:10,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:22:10,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2019-10-02 13:22:10,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 13:22:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 13:22:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:22:10,881 INFO L87 Difference]: Start difference. First operand 41626 states and 67369 transitions. Second operand 31 states. [2019-10-02 13:22:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:42,375 INFO L93 Difference]: Finished difference Result 204371 states and 328211 transitions. [2019-10-02 13:22:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 13:22:42,375 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 240 [2019-10-02 13:22:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:42,888 INFO L225 Difference]: With dead ends: 204371 [2019-10-02 13:22:42,889 INFO L226 Difference]: Without dead ends: 188755 [2019-10-02 13:22:42,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=877, Invalid=8053, Unknown=0, NotChecked=0, Total=8930 [2019-10-02 13:22:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188755 states. [2019-10-02 13:22:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188755 to 179113. [2019-10-02 13:22:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179113 states. [2019-10-02 13:22:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179113 states to 179113 states and 293443 transitions. [2019-10-02 13:22:55,783 INFO L78 Accepts]: Start accepts. Automaton has 179113 states and 293443 transitions. Word has length 240 [2019-10-02 13:22:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:55,783 INFO L475 AbstractCegarLoop]: Abstraction has 179113 states and 293443 transitions. [2019-10-02 13:22:55,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 13:22:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 179113 states and 293443 transitions. [2019-10-02 13:22:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:22:56,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:56,380 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:56,380 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:56,380 INFO L82 PathProgramCache]: Analyzing trace with hash -411131919, now seen corresponding path program 1 times [2019-10-02 13:22:56,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:56,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:56,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:56,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:56,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:56,499 INFO L87 Difference]: Start difference. First operand 179113 states and 293443 transitions. Second operand 3 states. [2019-10-02 13:23:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:15,343 INFO L93 Difference]: Finished difference Result 452561 states and 762193 transitions. [2019-10-02 13:23:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:15,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:23:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:16,333 INFO L225 Difference]: With dead ends: 452561 [2019-10-02 13:23:16,333 INFO L226 Difference]: Without dead ends: 276283 [2019-10-02 13:23:16,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276283 states. [2019-10-02 13:23:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276283 to 276009. [2019-10-02 13:23:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276009 states. [2019-10-02 13:23:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276009 states to 276009 states and 469434 transitions. [2019-10-02 13:23:38,850 INFO L78 Accepts]: Start accepts. Automaton has 276009 states and 469434 transitions. Word has length 234 [2019-10-02 13:23:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:38,851 INFO L475 AbstractCegarLoop]: Abstraction has 276009 states and 469434 transitions. [2019-10-02 13:23:38,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 276009 states and 469434 transitions. [2019-10-02 13:23:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:23:39,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:39,865 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:39,865 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1488048807, now seen corresponding path program 1 times [2019-10-02 13:23:39,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:39,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:39,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:39,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:39,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:39,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:39,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:39,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:39,974 INFO L87 Difference]: Start difference. First operand 276009 states and 469434 transitions. Second operand 3 states. [2019-10-02 13:24:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:12,677 INFO L93 Difference]: Finished difference Result 727713 states and 1256123 transitions. [2019-10-02 13:24:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:12,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 13:24:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:14,281 INFO L225 Difference]: With dead ends: 727713 [2019-10-02 13:24:14,281 INFO L226 Difference]: Without dead ends: 455199 [2019-10-02 13:24:14,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455199 states. [2019-10-02 13:25:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455199 to 448943. [2019-10-02 13:25:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448943 states. [2019-10-02 13:25:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448943 states to 448943 states and 777322 transitions. [2019-10-02 13:25:03,498 INFO L78 Accepts]: Start accepts. Automaton has 448943 states and 777322 transitions. Word has length 235 [2019-10-02 13:25:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:03,499 INFO L475 AbstractCegarLoop]: Abstraction has 448943 states and 777322 transitions. [2019-10-02 13:25:03,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 448943 states and 777322 transitions. [2019-10-02 13:25:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:25:06,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:06,412 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:06,412 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:06,412 INFO L82 PathProgramCache]: Analyzing trace with hash -308726385, now seen corresponding path program 1 times [2019-10-02 13:25:06,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:06,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:06,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:06,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:06,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:06,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:06,532 INFO L87 Difference]: Start difference. First operand 448943 states and 777322 transitions. Second operand 3 states. [2019-10-02 13:26:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:16,371 INFO L93 Difference]: Finished difference Result 1231583 states and 2150289 transitions. [2019-10-02 13:26:16,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:16,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-02 13:26:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:19,094 INFO L225 Difference]: With dead ends: 1231583 [2019-10-02 13:26:19,094 INFO L226 Difference]: Without dead ends: 787295 [2019-10-02 13:26:19,920 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:26:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787295 states. [2019-10-02 13:27:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787295 to 786939. [2019-10-02 13:27:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786939 states. [2019-10-02 13:28:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786939 states to 786939 states and 1367144 transitions. [2019-10-02 13:28:01,369 INFO L78 Accepts]: Start accepts. Automaton has 786939 states and 1367144 transitions. Word has length 236 [2019-10-02 13:28:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:01,369 INFO L475 AbstractCegarLoop]: Abstraction has 786939 states and 1367144 transitions. [2019-10-02 13:28:01,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:28:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 786939 states and 1367144 transitions.