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_spec8_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:57:00,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:57:00,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:57:00,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:57:00,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:57:00,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:57:00,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:57:00,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:57:00,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:57:00,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:57:00,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:57:00,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:57:00,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:57:00,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:57:00,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:57:00,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:57:00,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:57:00,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:57:00,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:57:00,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:57:00,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:57:00,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:57:00,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:57:00,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:57:00,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:57:00,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:57:00,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:57:00,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:57:00,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:57:00,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:57:00,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:57:00,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:57:00,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:57:00,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:57:00,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:57:00,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:57:00,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:57:00,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:57:00,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:57:00,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:57:00,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:57:00,106 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:57:00,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:57:00,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:57:00,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:57:00,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:57:00,135 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:57:00,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:57:00,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:57:00,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:57:00,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:57:00,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:57:00,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:57:00,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:57:00,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:57:00,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:57:00,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:57:00,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:57:00,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:57:00,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:57:00,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:57:00,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:57:00,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:57:00,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:57:00,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:57:00,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:57:00,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:57:00,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:57:00,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:57:00,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:57:00,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:57:00,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:57:00,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:57:00,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:57:00,211 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:57:00,211 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:57:00,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product21.cil.c [2019-10-02 13:57:00,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858c883c2/992a51fedc7a4bd8a9674396a89dd402/FLAG611df6c2b [2019-10-02 13:57:00,888 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:57:00,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product21.cil.c [2019-10-02 13:57:00,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858c883c2/992a51fedc7a4bd8a9674396a89dd402/FLAG611df6c2b [2019-10-02 13:57:01,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858c883c2/992a51fedc7a4bd8a9674396a89dd402 [2019-10-02 13:57:01,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:57:01,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:57:01,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:57:01,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:57:01,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:57:01,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:57:01" (1/1) ... [2019-10-02 13:57:01,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314f6940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:01, skipping insertion in model container [2019-10-02 13:57:01,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:57:01" (1/1) ... [2019-10-02 13:57:01,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:57:01,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:57:02,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:57:02,059 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:57:02,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:57:02,307 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:57:02,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02 WrapperNode [2019-10-02 13:57:02,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:57:02,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:57:02,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:57:02,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:57:02,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (1/1) ... [2019-10-02 13:57:02,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:57:02,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:57:02,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:57:02,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:57:02,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (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:57:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:57:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:57:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:57:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:57:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:57:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:57:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:57:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:57:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:57:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:57:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:57:02,645 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:57:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:57:02,646 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:57:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:57:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:57:02,651 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:57:02,651 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:57:02,652 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:57:02,652 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:57:02,652 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:57:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:57:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:57:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:57:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:57:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:57:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:57:02,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:57:02,655 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:57:02,655 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:57:02,655 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:57:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:57:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:57:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:57:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:57:02,657 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 13:57:02,657 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:57:02,657 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:57:02,657 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:57:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:57:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:57:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:57:02,658 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:57:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:57:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:57:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:57:02,659 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:57:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:57:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:57:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:57:02,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:57:02,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:57:02,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:57:02,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:57:02,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:57:02,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:57:02,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:57:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:57:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:57:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:57:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:57:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:57:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:57:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:57:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:57:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:57:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:57:02,666 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:57:02,666 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:57:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:57:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:57:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:57:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:57:02,668 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:57:02,669 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:57:02,669 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:57:02,669 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:57:02,670 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:57:02,671 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:57:02,671 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:57:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:57:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:57:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:57:02,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:57:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:57:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:57:02,674 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:57:02,675 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:57:02,676 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:57:02,676 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:57:02,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:57:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:57:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:57:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:57:02,677 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:57:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:57:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:57:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:57:02,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:57:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:57:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:57:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:57:02,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:57:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:57:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:57:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:57:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:57:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:57:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:57:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:57:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:57:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:57:02,681 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:57:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:57:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:57:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:57:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:57:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:57:02,684 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:57:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:57:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:57:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:57:02,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:57:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:57:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:57:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:57:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:57:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:57:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:57:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:57:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:57:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:57:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:57:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:57:02,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:57:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:57:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:57:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:57:02,701 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:57:02,702 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:57:02,702 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:57:02,702 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:57:02,703 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:57:02,704 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:57:02,704 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:57:02,704 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:57:02,704 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:57:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:57:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:57:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:57:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:57:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:57:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:57:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:57:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:57:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:57:02,707 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:57:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:57:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:57:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:57:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:57:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:57:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:57:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:57:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 13:57:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:57:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:57:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:57:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:57:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:57:02,713 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:57:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:57:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:57:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:57:02,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:57:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:57:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:57:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:57:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:57:02,715 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:57:02,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:57:02,716 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:57:02,716 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:57:02,717 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:57:02,717 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:57:02,717 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:57:02,717 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:57:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:57:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:57:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:57:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:57:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:57:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:57:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:57:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:57:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:57:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:57:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:57:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:57:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:57:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:57:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:57:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:57:02,721 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:57:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:57:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:57:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:57:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:57:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:57:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:57:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:57:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:57:05,369 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:57:05,369 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:57:05,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:57:05 BoogieIcfgContainer [2019-10-02 13:57:05,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:57:05,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:57:05,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:57:05,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:57:05,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:57:01" (1/3) ... [2019-10-02 13:57:05,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3895f678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:57:05, skipping insertion in model container [2019-10-02 13:57:05,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:57:02" (2/3) ... [2019-10-02 13:57:05,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3895f678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:57:05, skipping insertion in model container [2019-10-02 13:57:05,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:57:05" (3/3) ... [2019-10-02 13:57:05,380 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product21.cil.c [2019-10-02 13:57:05,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:57:05,404 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:57:05,422 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:57:05,467 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:57:05,468 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:57:05,468 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:57:05,469 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:57:05,469 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:57:05,469 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:57:05,469 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:57:05,469 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:57:05,469 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:57:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states. [2019-10-02 13:57:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 13:57:05,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:05,547 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:05,550 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:05,559 INFO L82 PathProgramCache]: Analyzing trace with hash 857697907, now seen corresponding path program 1 times [2019-10-02 13:57:05,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:05,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:57:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:06,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:57:06,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:57:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:57:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:57:06,218 INFO L87 Difference]: Start difference. First operand 573 states. Second operand 2 states. [2019-10-02 13:57:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:06,299 INFO L93 Difference]: Finished difference Result 832 states and 1126 transitions. [2019-10-02 13:57:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:57:06,301 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 13:57:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:06,344 INFO L225 Difference]: With dead ends: 832 [2019-10-02 13:57:06,344 INFO L226 Difference]: Without dead ends: 544 [2019-10-02 13:57:06,357 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:57:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-02 13:57:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-10-02 13:57:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-02 13:57:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 742 transitions. [2019-10-02 13:57:06,506 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 742 transitions. Word has length 154 [2019-10-02 13:57:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:06,509 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 742 transitions. [2019-10-02 13:57:06,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:57:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 742 transitions. [2019-10-02 13:57:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 13:57:06,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:06,525 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:06,525 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2017038380, now seen corresponding path program 1 times [2019-10-02 13:57:06,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:06,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:57:06,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:06,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:57:06,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:57:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:57:06,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:57:06,772 INFO L87 Difference]: Start difference. First operand 544 states and 742 transitions. Second operand 3 states. [2019-10-02 13:57:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:06,843 INFO L93 Difference]: Finished difference Result 815 states and 1092 transitions. [2019-10-02 13:57:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:57:06,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 13:57:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:06,848 INFO L225 Difference]: With dead ends: 815 [2019-10-02 13:57:06,849 INFO L226 Difference]: Without dead ends: 547 [2019-10-02 13:57:06,852 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:57:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-02 13:57:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2019-10-02 13:57:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 13:57:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 744 transitions. [2019-10-02 13:57:06,892 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 744 transitions. Word has length 155 [2019-10-02 13:57:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:06,894 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 744 transitions. [2019-10-02 13:57:06,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:57:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 744 transitions. [2019-10-02 13:57:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 13:57:06,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:06,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:06,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash 480175040, now seen corresponding path program 1 times [2019-10-02 13:57:06,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:06,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:06,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:06,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:57:07,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:57:07,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:57:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:57:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:57:07,175 INFO L87 Difference]: Start difference. First operand 546 states and 744 transitions. Second operand 3 states. [2019-10-02 13:57:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:07,215 INFO L93 Difference]: Finished difference Result 1070 states and 1489 transitions. [2019-10-02 13:57:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:57:07,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-02 13:57:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:07,220 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 13:57:07,220 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 13:57:07,222 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:57:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 13:57:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 588. [2019-10-02 13:57:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 13:57:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2019-10-02 13:57:07,250 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 161 [2019-10-02 13:57:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:07,252 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2019-10-02 13:57:07,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:57:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2019-10-02 13:57:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 13:57:07,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:07,262 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:07,262 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -868910391, now seen corresponding path program 1 times [2019-10-02 13:57:07,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:07,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:07,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:57:07,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:07,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:57:07,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:57:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:57:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:57:07,636 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2019-10-02 13:57:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:07,705 INFO L93 Difference]: Finished difference Result 957 states and 1317 transitions. [2019-10-02 13:57:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:57:07,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 13:57:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:07,718 INFO L225 Difference]: With dead ends: 957 [2019-10-02 13:57:07,719 INFO L226 Difference]: Without dead ends: 702 [2019-10-02 13:57:07,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:57:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-02 13:57:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 701. [2019-10-02 13:57:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-10-02 13:57:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 978 transitions. [2019-10-02 13:57:07,780 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 978 transitions. Word has length 162 [2019-10-02 13:57:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:07,781 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 978 transitions. [2019-10-02 13:57:07,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:57:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 978 transitions. [2019-10-02 13:57:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 13:57:07,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:07,795 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:07,795 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1149971746, now seen corresponding path program 1 times [2019-10-02 13:57:07,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:07,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:07,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:57:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:57:08,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:57:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:57:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:57:08,223 INFO L87 Difference]: Start difference. First operand 701 states and 978 transitions. Second operand 6 states. [2019-10-02 13:57:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:09,121 INFO L93 Difference]: Finished difference Result 1710 states and 2381 transitions. [2019-10-02 13:57:09,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:57:09,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2019-10-02 13:57:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:09,130 INFO L225 Difference]: With dead ends: 1710 [2019-10-02 13:57:09,130 INFO L226 Difference]: Without dead ends: 1353 [2019-10-02 13:57:09,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-10-02 13:57:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1342. [2019-10-02 13:57:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-02 13:57:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1892 transitions. [2019-10-02 13:57:09,188 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1892 transitions. Word has length 286 [2019-10-02 13:57:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:09,189 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1892 transitions. [2019-10-02 13:57:09,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:57:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1892 transitions. [2019-10-02 13:57:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 13:57:09,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:09,197 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:09,197 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1823902781, now seen corresponding path program 1 times [2019-10-02 13:57:09,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:57:09,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:57:09,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:57:09,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:57:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:09,487 INFO L87 Difference]: Start difference. First operand 1342 states and 1892 transitions. Second operand 9 states. [2019-10-02 13:57:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:10,043 INFO L93 Difference]: Finished difference Result 2053 states and 2833 transitions. [2019-10-02 13:57:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:57:10,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 287 [2019-10-02 13:57:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:10,051 INFO L225 Difference]: With dead ends: 2053 [2019-10-02 13:57:10,051 INFO L226 Difference]: Without dead ends: 1316 [2019-10-02 13:57:10,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:57:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-10-02 13:57:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1312. [2019-10-02 13:57:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-10-02 13:57:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1841 transitions. [2019-10-02 13:57:10,146 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1841 transitions. Word has length 287 [2019-10-02 13:57:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:10,148 INFO L475 AbstractCegarLoop]: Abstraction has 1312 states and 1841 transitions. [2019-10-02 13:57:10,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:57:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1841 transitions. [2019-10-02 13:57:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 13:57:10,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:10,170 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:10,170 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:10,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 58369020, now seen corresponding path program 1 times [2019-10-02 13:57:10,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:57:10,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:57:10,765 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:10,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:11,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:57:11,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:57:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:57:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:57:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 13:57:11,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:57:11,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:57:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:57:11,991 INFO L87 Difference]: Start difference. First operand 1312 states and 1841 transitions. Second operand 29 states. [2019-10-02 13:57:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:59,993 INFO L93 Difference]: Finished difference Result 8588 states and 12549 transitions. [2019-10-02 13:57:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 13:57:59,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 280 [2019-10-02 13:57:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:00,042 INFO L225 Difference]: With dead ends: 8588 [2019-10-02 13:58:00,042 INFO L226 Difference]: Without dead ends: 7136 [2019-10-02 13:58:00,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10483 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 13:58:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2019-10-02 13:58:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 6738. [2019-10-02 13:58:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6738 states. [2019-10-02 13:58:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 9656 transitions. [2019-10-02 13:58:00,660 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 9656 transitions. Word has length 280 [2019-10-02 13:58:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:00,662 INFO L475 AbstractCegarLoop]: Abstraction has 6738 states and 9656 transitions. [2019-10-02 13:58:00,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:58:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 9656 transitions. [2019-10-02 13:58:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:58:00,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:00,686 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:00,687 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2061917498, now seen corresponding path program 1 times [2019-10-02 13:58:00,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:00,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:00,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:00,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:00,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:58:01,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:01,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:58:01,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:58:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:58:01,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:58:01,021 INFO L87 Difference]: Start difference. First operand 6738 states and 9656 transitions. Second operand 5 states. [2019-10-02 13:58:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:01,273 INFO L93 Difference]: Finished difference Result 11971 states and 16972 transitions. [2019-10-02 13:58:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:58:01,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-10-02 13:58:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:01,314 INFO L225 Difference]: With dead ends: 11971 [2019-10-02 13:58:01,315 INFO L226 Difference]: Without dead ends: 6335 [2019-10-02 13:58:01,339 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:58:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6335 states. [2019-10-02 13:58:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6335 to 6261. [2019-10-02 13:58:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6261 states. [2019-10-02 13:58:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6261 states to 6261 states and 8948 transitions. [2019-10-02 13:58:01,732 INFO L78 Accepts]: Start accepts. Automaton has 6261 states and 8948 transitions. Word has length 284 [2019-10-02 13:58:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:01,733 INFO L475 AbstractCegarLoop]: Abstraction has 6261 states and 8948 transitions. [2019-10-02 13:58:01,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:58:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6261 states and 8948 transitions. [2019-10-02 13:58:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 13:58:01,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:01,760 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:01,761 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash 262573479, now seen corresponding path program 1 times [2019-10-02 13:58:01,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:01,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:01,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:01,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:58:02,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:02,294 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:58:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:03,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:58:03,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 13:58:03,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:03,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 13:58:03,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 13:58:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 13:58:03,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:58:03,962 INFO L87 Difference]: Start difference. First operand 6261 states and 8948 transitions. Second operand 21 states. [2019-10-02 13:58:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:06,842 INFO L93 Difference]: Finished difference Result 13149 states and 19471 transitions. [2019-10-02 13:58:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 13:58:06,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 282 [2019-10-02 13:58:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:06,897 INFO L225 Difference]: With dead ends: 13149 [2019-10-02 13:58:06,898 INFO L226 Difference]: Without dead ends: 6773 [2019-10-02 13:58:06,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:58:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2019-10-02 13:58:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6731. [2019-10-02 13:58:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-10-02 13:58:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 9726 transitions. [2019-10-02 13:58:07,392 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 9726 transitions. Word has length 282 [2019-10-02 13:58:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:07,392 INFO L475 AbstractCegarLoop]: Abstraction has 6731 states and 9726 transitions. [2019-10-02 13:58:07,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 13:58:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 9726 transitions. [2019-10-02 13:58:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 13:58:07,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:07,425 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:07,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash 105915093, now seen corresponding path program 1 times [2019-10-02 13:58:07,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:07,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:58:07,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:07,851 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:58:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:08,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:58:08,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:58:09,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:09,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:58:09,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:58:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:58:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:58:09,328 INFO L87 Difference]: Start difference. First operand 6731 states and 9726 transitions. Second operand 25 states. [2019-10-02 13:58:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:55,142 INFO L93 Difference]: Finished difference Result 20121 states and 29484 transitions. [2019-10-02 13:58:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 13:58:55,142 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 283 [2019-10-02 13:58:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:55,207 INFO L225 Difference]: With dead ends: 20121 [2019-10-02 13:58:55,207 INFO L226 Difference]: Without dead ends: 11309 [2019-10-02 13:58:55,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9590 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 13:58:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11309 states. [2019-10-02 13:58:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11309 to 10015. [2019-10-02 13:58:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10015 states. [2019-10-02 13:58:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10015 states to 10015 states and 14500 transitions. [2019-10-02 13:58:55,950 INFO L78 Accepts]: Start accepts. Automaton has 10015 states and 14500 transitions. Word has length 283 [2019-10-02 13:58:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:55,950 INFO L475 AbstractCegarLoop]: Abstraction has 10015 states and 14500 transitions. [2019-10-02 13:58:55,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:58:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10015 states and 14500 transitions. [2019-10-02 13:58:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 13:58:55,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:55,973 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:55,974 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -748168850, now seen corresponding path program 1 times [2019-10-02 13:58:55,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:58:56,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:58:56,450 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:58:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:57,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:58:57,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:58:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:58:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:58:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:58:57,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:58:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:58:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:58:57,562 INFO L87 Difference]: Start difference. First operand 10015 states and 14500 transitions. Second operand 25 states. [2019-10-02 13:59:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:42,660 INFO L93 Difference]: Finished difference Result 28066 states and 41130 transitions. [2019-10-02 13:59:42,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 13:59:42,661 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 285 [2019-10-02 13:59:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:42,741 INFO L225 Difference]: With dead ends: 28066 [2019-10-02 13:59:42,742 INFO L226 Difference]: Without dead ends: 14885 [2019-10-02 13:59:42,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9591 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 13:59:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14885 states. [2019-10-02 13:59:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14885 to 12724. [2019-10-02 13:59:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12724 states. [2019-10-02 13:59:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12724 states to 12724 states and 18410 transitions. [2019-10-02 13:59:43,589 INFO L78 Accepts]: Start accepts. Automaton has 12724 states and 18410 transitions. Word has length 285 [2019-10-02 13:59:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:43,590 INFO L475 AbstractCegarLoop]: Abstraction has 12724 states and 18410 transitions. [2019-10-02 13:59:43,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:59:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12724 states and 18410 transitions. [2019-10-02 13:59:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 13:59:43,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:43,617 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:43,617 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1090434967, now seen corresponding path program 1 times [2019-10-02 13:59:43,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:59:44,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:59:44,271 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:59:44,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:45,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:59:45,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:59:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:59:45,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:59:45,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 13:59:45,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:59:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:59:45,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:59:45,284 INFO L87 Difference]: Start difference. First operand 12724 states and 18410 transitions. Second operand 29 states. [2019-10-02 13:59:58,435 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-10-02 14:00:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:32,515 INFO L93 Difference]: Finished difference Result 50122 states and 75289 transitions. [2019-10-02 14:00:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-10-02 14:00:32,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 286 [2019-10-02 14:00:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:32,698 INFO L225 Difference]: With dead ends: 50122 [2019-10-02 14:00:32,699 INFO L226 Difference]: Without dead ends: 32293 [2019-10-02 14:00:32,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15388 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-10-02 14:00:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32293 states. [2019-10-02 14:00:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32293 to 28228. [2019-10-02 14:00:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28228 states. [2019-10-02 14:00:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28228 states to 28228 states and 41599 transitions. [2019-10-02 14:00:34,743 INFO L78 Accepts]: Start accepts. Automaton has 28228 states and 41599 transitions. Word has length 286 [2019-10-02 14:00:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:34,744 INFO L475 AbstractCegarLoop]: Abstraction has 28228 states and 41599 transitions. [2019-10-02 14:00:34,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:00:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 28228 states and 41599 transitions. [2019-10-02 14:00:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 14:00:34,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:34,768 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:34,768 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1468697056, now seen corresponding path program 1 times [2019-10-02 14:00:34,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:34,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:00:34,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:34,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:00:34,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:00:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:00:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:00:35,000 INFO L87 Difference]: Start difference. First operand 28228 states and 41599 transitions. Second operand 9 states. [2019-10-02 14:00:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:35,744 INFO L93 Difference]: Finished difference Result 54402 states and 81995 transitions. [2019-10-02 14:00:35,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:00:35,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 289 [2019-10-02 14:00:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:35,872 INFO L225 Difference]: With dead ends: 54402 [2019-10-02 14:00:35,872 INFO L226 Difference]: Without dead ends: 29326 [2019-10-02 14:00:35,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:00:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29326 states. [2019-10-02 14:00:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29326 to 29063. [2019-10-02 14:00:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29063 states. [2019-10-02 14:00:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29063 states to 29063 states and 42956 transitions. [2019-10-02 14:00:37,667 INFO L78 Accepts]: Start accepts. Automaton has 29063 states and 42956 transitions. Word has length 289 [2019-10-02 14:00:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:37,668 INFO L475 AbstractCegarLoop]: Abstraction has 29063 states and 42956 transitions. [2019-10-02 14:00:37,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:00:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29063 states and 42956 transitions. [2019-10-02 14:00:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 14:00:37,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:37,691 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:37,691 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1665221819, now seen corresponding path program 1 times [2019-10-02 14:00:37,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:37,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 14:00:37,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:00:37,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:00:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:00:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:00:37,953 INFO L87 Difference]: Start difference. First operand 29063 states and 42956 transitions. Second operand 11 states. [2019-10-02 14:00:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:44,377 INFO L93 Difference]: Finished difference Result 68921 states and 103303 transitions. [2019-10-02 14:00:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:00:44,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 290 [2019-10-02 14:00:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:44,578 INFO L225 Difference]: With dead ends: 68921 [2019-10-02 14:00:44,578 INFO L226 Difference]: Without dead ends: 40999 [2019-10-02 14:00:44,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:00:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40999 states. [2019-10-02 14:00:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40999 to 39372. [2019-10-02 14:00:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39372 states. [2019-10-02 14:00:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39372 states to 39372 states and 59110 transitions. [2019-10-02 14:00:46,694 INFO L78 Accepts]: Start accepts. Automaton has 39372 states and 59110 transitions. Word has length 290 [2019-10-02 14:00:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:46,695 INFO L475 AbstractCegarLoop]: Abstraction has 39372 states and 59110 transitions. [2019-10-02 14:00:46,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:00:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39372 states and 59110 transitions. [2019-10-02 14:00:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-02 14:00:46,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:46,708 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:46,708 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:46,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:46,708 INFO L82 PathProgramCache]: Analyzing trace with hash -796970244, now seen corresponding path program 1 times [2019-10-02 14:00:46,709 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:46,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:46,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:46,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 14:00:46,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:46,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:46,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:46,924 INFO L87 Difference]: Start difference. First operand 39372 states and 59110 transitions. Second operand 3 states. [2019-10-02 14:00:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:47,824 INFO L93 Difference]: Finished difference Result 78999 states and 118729 transitions. [2019-10-02 14:00:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:47,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-02 14:00:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:48,044 INFO L225 Difference]: With dead ends: 78999 [2019-10-02 14:00:48,045 INFO L226 Difference]: Without dead ends: 39716 [2019-10-02 14:00:48,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39716 states. [2019-10-02 14:00:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39716 to 39712. [2019-10-02 14:00:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39712 states. [2019-10-02 14:00:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39712 states to 39712 states and 59708 transitions. [2019-10-02 14:00:50,107 INFO L78 Accepts]: Start accepts. Automaton has 39712 states and 59708 transitions. Word has length 328 [2019-10-02 14:00:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:50,107 INFO L475 AbstractCegarLoop]: Abstraction has 39712 states and 59708 transitions. [2019-10-02 14:00:50,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 39712 states and 59708 transitions. [2019-10-02 14:00:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 14:00:50,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:50,123 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:50,124 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1326665897, now seen corresponding path program 1 times [2019-10-02 14:00:50,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:50,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:50,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 14:00:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:50,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:50,334 INFO L87 Difference]: Start difference. First operand 39712 states and 59708 transitions. Second operand 3 states. [2019-10-02 14:00:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:53,057 INFO L93 Difference]: Finished difference Result 79979 states and 120459 transitions. [2019-10-02 14:00:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:53,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-10-02 14:00:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:53,169 INFO L225 Difference]: With dead ends: 79979 [2019-10-02 14:00:53,169 INFO L226 Difference]: Without dead ends: 40356 [2019-10-02 14:00:53,226 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40356 states. [2019-10-02 14:00:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40356 to 40352. [2019-10-02 14:00:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40352 states. [2019-10-02 14:00:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40352 states to 40352 states and 60832 transitions. [2019-10-02 14:00:54,504 INFO L78 Accepts]: Start accepts. Automaton has 40352 states and 60832 transitions. Word has length 336 [2019-10-02 14:00:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:54,505 INFO L475 AbstractCegarLoop]: Abstraction has 40352 states and 60832 transitions. [2019-10-02 14:00:54,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 40352 states and 60832 transitions. [2019-10-02 14:00:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 14:00:54,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:54,517 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:54,517 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash 109166118, now seen corresponding path program 1 times [2019-10-02 14:00:54,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:54,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:00:54,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:54,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:54,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:54,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:54,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:54,723 INFO L87 Difference]: Start difference. First operand 40352 states and 60832 transitions. Second operand 3 states. [2019-10-02 14:00:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:56,298 INFO L93 Difference]: Finished difference Result 81851 states and 123735 transitions. [2019-10-02 14:00:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:56,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 349 [2019-10-02 14:00:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:56,432 INFO L225 Difference]: With dead ends: 81851 [2019-10-02 14:00:56,433 INFO L226 Difference]: Without dead ends: 41588 [2019-10-02 14:00:56,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41588 states. [2019-10-02 14:00:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41588 to 41584. [2019-10-02 14:00:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41584 states. [2019-10-02 14:00:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41584 states to 41584 states and 62968 transitions. [2019-10-02 14:00:57,869 INFO L78 Accepts]: Start accepts. Automaton has 41584 states and 62968 transitions. Word has length 349 [2019-10-02 14:00:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 41584 states and 62968 transitions. [2019-10-02 14:00:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 41584 states and 62968 transitions. [2019-10-02 14:00:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 14:00:57,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:57,887 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:57,888 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1737580817, now seen corresponding path program 1 times [2019-10-02 14:00:57,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:57,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:57,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:57,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:00:58,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:00:58,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:00:58,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:00:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:00:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:58,573 INFO L87 Difference]: Start difference. First operand 41584 states and 62968 transitions. Second operand 3 states. [2019-10-02 14:00:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:59,684 INFO L93 Difference]: Finished difference Result 85451 states and 129967 transitions. [2019-10-02 14:00:59,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:59,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-02 14:00:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:59,830 INFO L225 Difference]: With dead ends: 85451 [2019-10-02 14:00:59,830 INFO L226 Difference]: Without dead ends: 43956 [2019-10-02 14:00:59,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43956 states. [2019-10-02 14:01:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43956 to 43952. [2019-10-02 14:01:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43952 states. [2019-10-02 14:01:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43952 states to 43952 states and 67032 transitions. [2019-10-02 14:01:01,895 INFO L78 Accepts]: Start accepts. Automaton has 43952 states and 67032 transitions. Word has length 332 [2019-10-02 14:01:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:01,895 INFO L475 AbstractCegarLoop]: Abstraction has 43952 states and 67032 transitions. [2019-10-02 14:01:01,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 43952 states and 67032 transitions. [2019-10-02 14:01:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:01:01,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:01,924 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:01,924 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1311978710, now seen corresponding path program 1 times [2019-10-02 14:01:01,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:01:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:02,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:02,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:02,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:02,111 INFO L87 Difference]: Start difference. First operand 43952 states and 67032 transitions. Second operand 3 states. [2019-10-02 14:01:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:03,306 INFO L93 Difference]: Finished difference Result 92363 states and 141871 transitions. [2019-10-02 14:01:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:01:03,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-10-02 14:01:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:03,452 INFO L225 Difference]: With dead ends: 92363 [2019-10-02 14:01:03,452 INFO L226 Difference]: Without dead ends: 48500 [2019-10-02 14:01:03,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48500 states. [2019-10-02 14:01:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48500 to 48496. [2019-10-02 14:01:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48496 states. [2019-10-02 14:01:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48496 states to 48496 states and 74808 transitions. [2019-10-02 14:01:05,532 INFO L78 Accepts]: Start accepts. Automaton has 48496 states and 74808 transitions. Word has length 331 [2019-10-02 14:01:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:05,533 INFO L475 AbstractCegarLoop]: Abstraction has 48496 states and 74808 transitions. [2019-10-02 14:01:05,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48496 states and 74808 transitions. [2019-10-02 14:01:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:01:05,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:05,583 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:05,583 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1082730495, now seen corresponding path program 1 times [2019-10-02 14:01:05,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:05,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:01:05,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:05,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:05,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:05,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:05,789 INFO L87 Difference]: Start difference. First operand 48496 states and 74808 transitions. Second operand 3 states. [2019-10-02 14:01:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:07,467 INFO L93 Difference]: Finished difference Result 105611 states and 164559 transitions. [2019-10-02 14:01:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:01:07,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-10-02 14:01:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:07,672 INFO L225 Difference]: With dead ends: 105611 [2019-10-02 14:01:07,672 INFO L226 Difference]: Without dead ends: 57204 [2019-10-02 14:01:07,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57204 states. [2019-10-02 14:01:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57204 to 57200. [2019-10-02 14:01:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57200 states. [2019-10-02 14:01:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57200 states to 57200 states and 89592 transitions. [2019-10-02 14:01:10,105 INFO L78 Accepts]: Start accepts. Automaton has 57200 states and 89592 transitions. Word has length 351 [2019-10-02 14:01:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:10,106 INFO L475 AbstractCegarLoop]: Abstraction has 57200 states and 89592 transitions. [2019-10-02 14:01:10,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:01:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 57200 states and 89592 transitions. [2019-10-02 14:01:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 14:01:10,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:10,163 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:10,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1777481124, now seen corresponding path program 1 times [2019-10-02 14:01:10,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:10,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:01:10,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:10,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:01:10,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:01:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:01:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:01:10,376 INFO L87 Difference]: Start difference. First operand 57200 states and 89592 transitions. Second operand 7 states. [2019-10-02 14:01:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:12,239 INFO L93 Difference]: Finished difference Result 114347 states and 179915 transitions. [2019-10-02 14:01:12,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:01:12,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 333 [2019-10-02 14:01:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:12,393 INFO L225 Difference]: With dead ends: 114347 [2019-10-02 14:01:12,393 INFO L226 Difference]: Without dead ends: 57236 [2019-10-02 14:01:12,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:01:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57236 states. [2019-10-02 14:01:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57236 to 57236. [2019-10-02 14:01:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57236 states. [2019-10-02 14:01:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57236 states to 57236 states and 89636 transitions. [2019-10-02 14:01:14,885 INFO L78 Accepts]: Start accepts. Automaton has 57236 states and 89636 transitions. Word has length 333 [2019-10-02 14:01:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:14,885 INFO L475 AbstractCegarLoop]: Abstraction has 57236 states and 89636 transitions. [2019-10-02 14:01:14,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:01:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 57236 states and 89636 transitions. [2019-10-02 14:01:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 14:01:14,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:14,940 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:14,941 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1487313940, now seen corresponding path program 1 times [2019-10-02 14:01:14,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 14:01:15,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:15,138 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:01:15,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:01:16,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 14:01:16,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:01:16,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 14:01:16,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:01:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:01:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:01:16,168 INFO L87 Difference]: Start difference. First operand 57236 states and 89636 transitions. Second operand 12 states. [2019-10-02 14:01:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:20,839 INFO L93 Difference]: Finished difference Result 114251 states and 179090 transitions. [2019-10-02 14:01:20,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:01:20,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 335 [2019-10-02 14:01:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:21,025 INFO L225 Difference]: With dead ends: 114251 [2019-10-02 14:01:21,025 INFO L226 Difference]: Without dead ends: 57091 [2019-10-02 14:01:21,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:01:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57091 states. [2019-10-02 14:01:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57091 to 57085. [2019-10-02 14:01:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57085 states. [2019-10-02 14:01:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57085 states to 57085 states and 88687 transitions. [2019-10-02 14:01:23,271 INFO L78 Accepts]: Start accepts. Automaton has 57085 states and 88687 transitions. Word has length 335 [2019-10-02 14:01:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:23,272 INFO L475 AbstractCegarLoop]: Abstraction has 57085 states and 88687 transitions. [2019-10-02 14:01:23,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:01:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 57085 states and 88687 transitions. [2019-10-02 14:01:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-10-02 14:01:23,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:23,330 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:23,331 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash -98411458, now seen corresponding path program 1 times [2019-10-02 14:01:23,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:23,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-02 14:01:23,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:23,596 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:01:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:24,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 3697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:01:24,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 14:01:24,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:01:24,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 14:01:24,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:01:24,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:01:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:01:24,561 INFO L87 Difference]: Start difference. First operand 57085 states and 88687 transitions. Second operand 12 states. [2019-10-02 14:01:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:28,076 INFO L93 Difference]: Finished difference Result 96439 states and 147060 transitions. [2019-10-02 14:01:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:01:28,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 355 [2019-10-02 14:01:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:28,353 INFO L225 Difference]: With dead ends: 96439 [2019-10-02 14:01:28,353 INFO L226 Difference]: Without dead ends: 58167 [2019-10-02 14:01:28,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:01:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58167 states. [2019-10-02 14:01:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58167 to 57807. [2019-10-02 14:01:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57807 states. [2019-10-02 14:01:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57807 states to 57807 states and 89743 transitions. [2019-10-02 14:01:30,889 INFO L78 Accepts]: Start accepts. Automaton has 57807 states and 89743 transitions. Word has length 355 [2019-10-02 14:01:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:30,889 INFO L475 AbstractCegarLoop]: Abstraction has 57807 states and 89743 transitions. [2019-10-02 14:01:30,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:01:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 57807 states and 89743 transitions. [2019-10-02 14:01:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:01:30,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:30,949 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:30,949 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1380949543, now seen corresponding path program 1 times [2019-10-02 14:01:30,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:30,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:30,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:30,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:01:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:01:31,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:01:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:01:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:01:31,134 INFO L87 Difference]: Start difference. First operand 57807 states and 89743 transitions. Second operand 6 states. [2019-10-02 14:01:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:32,989 INFO L93 Difference]: Finished difference Result 114823 states and 178310 transitions. [2019-10-02 14:01:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:01:32,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 351 [2019-10-02 14:01:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:33,165 INFO L225 Difference]: With dead ends: 114823 [2019-10-02 14:01:33,166 INFO L226 Difference]: Without dead ends: 57811 [2019-10-02 14:01:33,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:01:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57811 states. [2019-10-02 14:01:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57811 to 57807. [2019-10-02 14:01:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57807 states. [2019-10-02 14:01:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57807 states to 57807 states and 89486 transitions. [2019-10-02 14:01:37,714 INFO L78 Accepts]: Start accepts. Automaton has 57807 states and 89486 transitions. Word has length 351 [2019-10-02 14:01:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:37,714 INFO L475 AbstractCegarLoop]: Abstraction has 57807 states and 89486 transitions. [2019-10-02 14:01:37,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:01:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 57807 states and 89486 transitions. [2019-10-02 14:01:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 14:01:37,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:37,774 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:37,774 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash -688859923, now seen corresponding path program 1 times [2019-10-02 14:01:37,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:37,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-02 14:01:37,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:01:37,988 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 14:01:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:38,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3707 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:01:38,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:01:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 14:01:39,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:01:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-10-02 14:01:39,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:01:39,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:01:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:01:39,029 INFO L87 Difference]: Start difference. First operand 57807 states and 89486 transitions. Second operand 9 states. [2019-10-02 14:01:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:43,553 INFO L93 Difference]: Finished difference Result 152769 states and 234793 transitions. [2019-10-02 14:01:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:01:43,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 360 [2019-10-02 14:01:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:43,869 INFO L225 Difference]: With dead ends: 152769 [2019-10-02 14:01:43,869 INFO L226 Difference]: Without dead ends: 114328 [2019-10-02 14:01:43,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:01:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114328 states. [2019-10-02 14:01:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114328 to 113437. [2019-10-02 14:01:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113437 states. [2019-10-02 14:01:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113437 states to 113437 states and 175732 transitions. [2019-10-02 14:01:50,986 INFO L78 Accepts]: Start accepts. Automaton has 113437 states and 175732 transitions. Word has length 360 [2019-10-02 14:01:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:50,987 INFO L475 AbstractCegarLoop]: Abstraction has 113437 states and 175732 transitions. [2019-10-02 14:01:50,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:01:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 113437 states and 175732 transitions. [2019-10-02 14:01:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-02 14:01:51,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:51,105 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:01:51,106 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash -604328072, now seen corresponding path program 1 times [2019-10-02 14:01:51,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:51,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:51,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 14:01:51,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:51,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:01:51,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:01:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:01:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:01:51,322 INFO L87 Difference]: Start difference. First operand 113437 states and 175732 transitions. Second operand 6 states. [2019-10-02 14:01:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:01:54,893 INFO L93 Difference]: Finished difference Result 222529 states and 344445 transitions. [2019-10-02 14:01:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:01:54,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 377 [2019-10-02 14:01:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:55,285 INFO L225 Difference]: With dead ends: 222529 [2019-10-02 14:01:55,286 INFO L226 Difference]: Without dead ends: 113443 [2019-10-02 14:01:55,489 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:01:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113443 states. [2019-10-02 14:02:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113443 to 113437. [2019-10-02 14:02:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113437 states. [2019-10-02 14:02:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113437 states to 113437 states and 175331 transitions. [2019-10-02 14:02:04,064 INFO L78 Accepts]: Start accepts. Automaton has 113437 states and 175331 transitions. Word has length 377 [2019-10-02 14:02:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:02:04,064 INFO L475 AbstractCegarLoop]: Abstraction has 113437 states and 175331 transitions. [2019-10-02 14:02:04,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:02:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 113437 states and 175331 transitions. [2019-10-02 14:02:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-10-02 14:02:04,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:02:04,186 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:02:04,186 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:02:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:02:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1880643217, now seen corresponding path program 1 times [2019-10-02 14:02:04,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:02:04,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:02:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:04,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:02:04,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:02:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:02:04,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:02:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:02:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:02:04,468 INFO L87 Difference]: Start difference. First operand 113437 states and 175331 transitions. Second operand 8 states. [2019-10-02 14:02:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:21,289 INFO L93 Difference]: Finished difference Result 339649 states and 549787 transitions. [2019-10-02 14:02:21,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:02:21,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 396 [2019-10-02 14:02:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:21,993 INFO L225 Difference]: With dead ends: 339649 [2019-10-02 14:02:21,993 INFO L226 Difference]: Without dead ends: 226915 [2019-10-02 14:02:22,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:02:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226915 states. [2019-10-02 14:02:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226915 to 164706. [2019-10-02 14:02:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164706 states. [2019-10-02 14:02:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164706 states to 164706 states and 270396 transitions. [2019-10-02 14:02:31,148 INFO L78 Accepts]: Start accepts. Automaton has 164706 states and 270396 transitions. Word has length 396 [2019-10-02 14:02:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:02:31,149 INFO L475 AbstractCegarLoop]: Abstraction has 164706 states and 270396 transitions. [2019-10-02 14:02:31,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:02:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 164706 states and 270396 transitions. [2019-10-02 14:02:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-02 14:02:31,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:02:31,490 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:02:31,490 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:02:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:02:31,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2113848631, now seen corresponding path program 1 times [2019-10-02 14:02:31,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:02:31,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:02:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:02:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:02:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:02:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:02:31,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:02:31,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:02:31,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:02:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:02:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:02:31,728 INFO L87 Difference]: Start difference. First operand 164706 states and 270396 transitions. Second operand 8 states. [2019-10-02 14:02:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:51,858 INFO L93 Difference]: Finished difference Result 487900 states and 847594 transitions. [2019-10-02 14:02:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:02:51,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 398 [2019-10-02 14:02:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:52,929 INFO L225 Difference]: With dead ends: 487900 [2019-10-02 14:02:52,929 INFO L226 Difference]: Without dead ends: 327077 [2019-10-02 14:02:53,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:02:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327077 states. [2019-10-02 14:03:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327077 to 263925. [2019-10-02 14:03:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263925 states. [2019-10-02 14:03:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263925 states to 263925 states and 466002 transitions. [2019-10-02 14:03:22,642 INFO L78 Accepts]: Start accepts. Automaton has 263925 states and 466002 transitions. Word has length 398 [2019-10-02 14:03:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:22,643 INFO L475 AbstractCegarLoop]: Abstraction has 263925 states and 466002 transitions. [2019-10-02 14:03:22,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:03:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 263925 states and 466002 transitions. [2019-10-02 14:03:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 14:03:23,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:23,434 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:03:23,434 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash 67534985, now seen corresponding path program 1 times [2019-10-02 14:03:23,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:23,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:23,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:03:23,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:03:23,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:03:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:03:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:03:23,699 INFO L87 Difference]: Start difference. First operand 263925 states and 466002 transitions. Second operand 8 states. [2019-10-02 14:04:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:05,966 INFO L93 Difference]: Finished difference Result 778027 states and 1463290 transitions. [2019-10-02 14:04:05,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:04:05,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 400 [2019-10-02 14:04:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:09,181 INFO L225 Difference]: With dead ends: 778027 [2019-10-02 14:04:09,182 INFO L226 Difference]: Without dead ends: 522488 [2019-10-02 14:04:09,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:04:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522488 states. [2019-10-02 14:04:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522488 to 453306. [2019-10-02 14:04:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453306 states. [2019-10-02 14:05:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453306 states to 453306 states and 863868 transitions. [2019-10-02 14:05:07,009 INFO L78 Accepts]: Start accepts. Automaton has 453306 states and 863868 transitions. Word has length 400 [2019-10-02 14:05:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:05:07,009 INFO L475 AbstractCegarLoop]: Abstraction has 453306 states and 863868 transitions. [2019-10-02 14:05:07,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:05:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 453306 states and 863868 transitions. [2019-10-02 14:05:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-02 14:05:11,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:05:11,081 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:05:11,081 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:05:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:05:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 548654066, now seen corresponding path program 1 times [2019-10-02 14:05:11,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:05:11,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:05:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:11,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:05:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:05:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:05:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-02 14:05:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:05:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:05:11,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:05:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:05:11,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:05:11,335 INFO L87 Difference]: Start difference. First operand 453306 states and 863868 transitions. Second operand 9 states. [2019-10-02 14:05:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:05:35,276 INFO L93 Difference]: Finished difference Result 551464 states and 1014439 transitions. [2019-10-02 14:05:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:05:35,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 381 [2019-10-02 14:05:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:05:36,710 INFO L225 Difference]: With dead ends: 551464 [2019-10-02 14:05:36,710 INFO L226 Difference]: Without dead ends: 378180 [2019-10-02 14:05:38,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:05:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378180 states. [2019-10-02 14:06:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378180 to 377594. [2019-10-02 14:06:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377594 states. [2019-10-02 14:06:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377594 states to 377594 states and 751298 transitions. [2019-10-02 14:06:19,944 INFO L78 Accepts]: Start accepts. Automaton has 377594 states and 751298 transitions. Word has length 381 [2019-10-02 14:06:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:06:19,945 INFO L475 AbstractCegarLoop]: Abstraction has 377594 states and 751298 transitions. [2019-10-02 14:06:19,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:06:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 377594 states and 751298 transitions. [2019-10-02 14:06:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-10-02 14:06:35,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:06:35,174 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:06:35,174 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:06:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:06:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1738290698, now seen corresponding path program 1 times [2019-10-02 14:06:35,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:06:35,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:06:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:35,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:06:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 14:06:35,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:06:35,526 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 14:06:35,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:06:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:06:36,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 3778 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:06:37,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:06:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-02 14:06:37,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:06:37,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2019-10-02 14:06:37,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:06:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:06:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:06:37,281 INFO L87 Difference]: Start difference. First operand 377594 states and 751298 transitions. Second operand 19 states. [2019-10-02 14:07:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:07:05,102 INFO L93 Difference]: Finished difference Result 737892 states and 1469534 transitions. [2019-10-02 14:07:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:07:05,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 379 [2019-10-02 14:07:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:07:08,040 INFO L225 Difference]: With dead ends: 737892 [2019-10-02 14:07:08,040 INFO L226 Difference]: Without dead ends: 377683 [2019-10-02 14:07:09,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 14:07:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377683 states.