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_spec1_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:54:47,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:54:47,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:54:47,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:54:47,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:54:47,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:54:47,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:54:47,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:54:47,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:54:47,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:54:47,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:54:47,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:54:47,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:54:47,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:54:47,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:54:47,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:54:47,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:54:47,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:54:47,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:54:47,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:54:47,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:54:47,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:54:47,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:54:47,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:54:47,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:54:47,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:54:47,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:54:47,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:54:47,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:54:47,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:54:47,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:54:47,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:54:47,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:54:47,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:54:47,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:54:47,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:54:47,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:54:47,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:54:47,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:54:47,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:54:47,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:54:47,286 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 12:54:47,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:54:47,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:54:47,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:54:47,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:54:47,312 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:54:47,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:54:47,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:54:47,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:54:47,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:54:47,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:54:47,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:54:47,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:54:47,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:54:47,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:54:47,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:54:47,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:54:47,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:54:47,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:54:47,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:54:47,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:54:47,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:54:47,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:54:47,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:54:47,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:54:47,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:54:47,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:54:47,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:54:47,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:54:47,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:54:47,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product28.cil.c [2019-10-02 12:54:47,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d104e55d/d11a935bf3484862ac84421eb94f586a/FLAGcf529092f [2019-10-02 12:54:48,098 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:54:48,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product28.cil.c [2019-10-02 12:54:48,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d104e55d/d11a935bf3484862ac84421eb94f586a/FLAGcf529092f [2019-10-02 12:54:48,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d104e55d/d11a935bf3484862ac84421eb94f586a [2019-10-02 12:54:48,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:54:48,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:54:48,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:54:48,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:54:48,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:54:48,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:54:48" (1/1) ... [2019-10-02 12:54:48,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:48, skipping insertion in model container [2019-10-02 12:54:48,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:54:48" (1/1) ... [2019-10-02 12:54:48,348 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:54:48,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:54:49,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:54:49,300 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:54:49,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:54:49,512 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:54:49,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49 WrapperNode [2019-10-02 12:54:49,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:54:49,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:54:49,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:54:49,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:54:49,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (1/1) ... [2019-10-02 12:54:49,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:54:49,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:54:49,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:54:49,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:54:49,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (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 12:54:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:54:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:54:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:54:49,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:54:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:54:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:54:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:54:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:54:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:54:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:54:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:54:49,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:54:49,801 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:54:49,802 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:54:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:54:49,803 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:54:49,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:54:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:54:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:54:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:54:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:54:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:54:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:54:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:54:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:54:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:54:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:54:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:54:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:54:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:54:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:54:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:54:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:54:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:54:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:54:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:54:49,811 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:54:49,811 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:54:49,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:54:49,811 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:54:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 12:54:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 12:54:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:54:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:54:49,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:54:49,813 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:54:49,813 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:54:49,813 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:54:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:54:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:54:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:54:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:54:49,815 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:54:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:54:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:54:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:54:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:54:49,816 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:54:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:54:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:54:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:54:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:54:49,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:54:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:54:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:54:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:54:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:54:49,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:54:49,820 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:54:49,820 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:54:49,821 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:54:49,821 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:54:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:54:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:54:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:54:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:54:49,824 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:54:49,825 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:54:49,826 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:54:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:54:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:54:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:54:49,826 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:54:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:54:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:54:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:54:49,827 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:54:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:54:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:54:49,828 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:54:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:54:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:54:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:54:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:54:49,833 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:54:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:54:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:54:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:54:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:54:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:54:49,843 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:54:49,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:54:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:54:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:54:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:54:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:54:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:54:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:54:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:54:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:54:49,847 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:54:49,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:54:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:54:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:54:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:54:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:54:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:54:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:54:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:54:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:54:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:54:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:54:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:54:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:54:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:54:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:54:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 12:54:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:54:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:54:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:54:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:54:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:54:52,256 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:54:52,257 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:54:52,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:54:52 BoogieIcfgContainer [2019-10-02 12:54:52,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:54:52,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:54:52,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:54:52,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:54:52,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:54:48" (1/3) ... [2019-10-02 12:54:52,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626eb5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:54:52, skipping insertion in model container [2019-10-02 12:54:52,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:54:49" (2/3) ... [2019-10-02 12:54:52,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626eb5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:54:52, skipping insertion in model container [2019-10-02 12:54:52,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:54:52" (3/3) ... [2019-10-02 12:54:52,269 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2019-10-02 12:54:52,280 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:54:52,295 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:54:52,315 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:54:52,371 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:54:52,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:54:52,373 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:54:52,373 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:54:52,373 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:54:52,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:54:52,373 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:54:52,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:54:52,373 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:54:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states. [2019-10-02 12:54:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:54:52,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:52,450 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:52,456 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 90339027, now seen corresponding path program 1 times [2019-10-02 12:54:52,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:52,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:52,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:52,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:53,128 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 12:54:53,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:54:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:54:53,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:54:53,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:54:53,154 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 2 states. [2019-10-02 12:54:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:53,240 INFO L93 Difference]: Finished difference Result 715 states and 948 transitions. [2019-10-02 12:54:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:54:53,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 12:54:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:53,265 INFO L225 Difference]: With dead ends: 715 [2019-10-02 12:54:53,265 INFO L226 Difference]: Without dead ends: 458 [2019-10-02 12:54:53,276 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 12:54:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-02 12:54:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-10-02 12:54:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-02 12:54:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 611 transitions. [2019-10-02 12:54:53,407 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 611 transitions. Word has length 158 [2019-10-02 12:54:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:53,409 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 611 transitions. [2019-10-02 12:54:53,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:54:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 611 transitions. [2019-10-02 12:54:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:54:53,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:53,415 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:53,416 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:53,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2056663134, now seen corresponding path program 1 times [2019-10-02 12:54:53,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:53,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:53,649 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 12:54:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:53,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:53,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:53,658 INFO L87 Difference]: Start difference. First operand 458 states and 611 transitions. Second operand 3 states. [2019-10-02 12:54:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:53,721 INFO L93 Difference]: Finished difference Result 698 states and 916 transitions. [2019-10-02 12:54:53,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:53,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 12:54:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:53,727 INFO L225 Difference]: With dead ends: 698 [2019-10-02 12:54:53,727 INFO L226 Difference]: Without dead ends: 461 [2019-10-02 12:54:53,730 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 12:54:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-02 12:54:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2019-10-02 12:54:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-02 12:54:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 613 transitions. [2019-10-02 12:54:53,754 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 613 transitions. Word has length 159 [2019-10-02 12:54:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:53,754 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 613 transitions. [2019-10-02 12:54:53,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 613 transitions. [2019-10-02 12:54:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:54:53,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:53,758 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:53,759 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -916505354, now seen corresponding path program 1 times [2019-10-02 12:54:53,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:53,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:53,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:53,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:53,971 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 12:54:53,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:53,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:53,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:53,973 INFO L87 Difference]: Start difference. First operand 460 states and 613 transitions. Second operand 3 states. [2019-10-02 12:54:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:54,014 INFO L93 Difference]: Finished difference Result 894 states and 1221 transitions. [2019-10-02 12:54:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:54,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 12:54:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:54,019 INFO L225 Difference]: With dead ends: 894 [2019-10-02 12:54:54,019 INFO L226 Difference]: Without dead ends: 499 [2019-10-02 12:54:54,022 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 12:54:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-02 12:54:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2019-10-02 12:54:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-02 12:54:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 679 transitions. [2019-10-02 12:54:54,047 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 679 transitions. Word has length 165 [2019-10-02 12:54:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:54,048 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 679 transitions. [2019-10-02 12:54:54,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 679 transitions. [2019-10-02 12:54:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:54,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:54,056 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:54,057 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:54,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1378701961, now seen corresponding path program 1 times [2019-10-02 12:54:54,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:54,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:54:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-02 12:54:55,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 12:54:55,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 12:54:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1327, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 12:54:55,581 INFO L87 Difference]: Start difference. First operand 498 states and 679 transitions. Second operand 38 states. [2019-10-02 12:55:10,059 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-10-02 12:55:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:26,195 INFO L93 Difference]: Finished difference Result 4743 states and 6636 transitions. [2019-10-02 12:55:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-10-02 12:55:26,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 166 [2019-10-02 12:55:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:26,230 INFO L225 Difference]: With dead ends: 4743 [2019-10-02 12:55:26,230 INFO L226 Difference]: Without dead ends: 4274 [2019-10-02 12:55:26,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14259 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2247, Invalid=40395, Unknown=0, NotChecked=0, Total=42642 [2019-10-02 12:55:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2019-10-02 12:55:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4148. [2019-10-02 12:55:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2019-10-02 12:55:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 5811 transitions. [2019-10-02 12:55:26,532 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 5811 transitions. Word has length 166 [2019-10-02 12:55:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:26,533 INFO L475 AbstractCegarLoop]: Abstraction has 4148 states and 5811 transitions. [2019-10-02 12:55:26,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 12:55:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 5811 transitions. [2019-10-02 12:55:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:55:26,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:26,546 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:55:26,547 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash 180404994, now seen corresponding path program 1 times [2019-10-02 12:55:26,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:26,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:26,758 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 12:55:26,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:26,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:55:26,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:55:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:55:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:55:26,761 INFO L87 Difference]: Start difference. First operand 4148 states and 5811 transitions. Second operand 5 states. [2019-10-02 12:55:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:28,185 INFO L93 Difference]: Finished difference Result 10238 states and 14197 transitions. [2019-10-02 12:55:28,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:55:28,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 12:55:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:28,246 INFO L225 Difference]: With dead ends: 10238 [2019-10-02 12:55:28,246 INFO L226 Difference]: Without dead ends: 8891 [2019-10-02 12:55:28,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:55:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8891 states. [2019-10-02 12:55:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8891 to 8851. [2019-10-02 12:55:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8851 states. [2019-10-02 12:55:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 12324 transitions. [2019-10-02 12:55:28,844 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 12324 transitions. Word has length 168 [2019-10-02 12:55:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:28,845 INFO L475 AbstractCegarLoop]: Abstraction has 8851 states and 12324 transitions. [2019-10-02 12:55:28,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:55:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 12324 transitions. [2019-10-02 12:55:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:55:28,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:28,872 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:55:28,873 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1829698847, now seen corresponding path program 1 times [2019-10-02 12:55:28,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:28,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:28,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:28,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:28,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:55:29,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:55:29,346 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 12:55:29,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:29,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 2494 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:55:29,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:55:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:55:30,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:55:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 12:55:30,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:55:30,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:55:30,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:55:30,228 INFO L87 Difference]: Start difference. First operand 8851 states and 12324 transitions. Second operand 26 states. [2019-10-02 12:55:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:36,359 INFO L93 Difference]: Finished difference Result 15345 states and 21277 transitions. [2019-10-02 12:55:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:55:36,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 168 [2019-10-02 12:55:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:36,429 INFO L225 Difference]: With dead ends: 15345 [2019-10-02 12:55:36,429 INFO L226 Difference]: Without dead ends: 8376 [2019-10-02 12:55:36,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:55:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8376 states. [2019-10-02 12:55:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8376 to 7872. [2019-10-02 12:55:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7872 states. [2019-10-02 12:55:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 11051 transitions. [2019-10-02 12:55:37,085 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 11051 transitions. Word has length 168 [2019-10-02 12:55:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:37,087 INFO L475 AbstractCegarLoop]: Abstraction has 7872 states and 11051 transitions. [2019-10-02 12:55:37,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:55:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 11051 transitions. [2019-10-02 12:55:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:55:37,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:37,107 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:55:37,107 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1894895648, now seen corresponding path program 1 times [2019-10-02 12:55:37,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:37,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:37,441 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 12:55:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:55:37,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:55:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:55:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:55:37,444 INFO L87 Difference]: Start difference. First operand 7872 states and 11051 transitions. Second operand 11 states. [2019-10-02 12:55:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:37,970 INFO L93 Difference]: Finished difference Result 10381 states and 14317 transitions. [2019-10-02 12:55:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:55:37,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-10-02 12:55:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:38,014 INFO L225 Difference]: With dead ends: 10381 [2019-10-02 12:55:38,015 INFO L226 Difference]: Without dead ends: 5164 [2019-10-02 12:55:38,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:55:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2019-10-02 12:55:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5104. [2019-10-02 12:55:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-10-02 12:55:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7423 transitions. [2019-10-02 12:55:38,346 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7423 transitions. Word has length 169 [2019-10-02 12:55:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:38,347 INFO L475 AbstractCegarLoop]: Abstraction has 5104 states and 7423 transitions. [2019-10-02 12:55:38,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:55:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7423 transitions. [2019-10-02 12:55:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:55:38,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:38,368 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 12:55:38,368 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1118562707, now seen corresponding path program 1 times [2019-10-02 12:55:38,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:38,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:38,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:38,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:55:38,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:55:38,594 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 12:55:38,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:39,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:55:39,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:55:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:55:39,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:55:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 12:55:39,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:55:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:55:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:55:39,374 INFO L87 Difference]: Start difference. First operand 5104 states and 7423 transitions. Second operand 12 states. [2019-10-02 12:55:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:40,699 INFO L93 Difference]: Finished difference Result 8794 states and 12588 transitions. [2019-10-02 12:55:40,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:55:40,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2019-10-02 12:55:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:40,721 INFO L225 Difference]: With dead ends: 8794 [2019-10-02 12:55:40,722 INFO L226 Difference]: Without dead ends: 4431 [2019-10-02 12:55:40,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:55:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2019-10-02 12:55:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 4395. [2019-10-02 12:55:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-10-02 12:55:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6288 transitions. [2019-10-02 12:55:40,936 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6288 transitions. Word has length 170 [2019-10-02 12:55:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:40,936 INFO L475 AbstractCegarLoop]: Abstraction has 4395 states and 6288 transitions. [2019-10-02 12:55:40,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:55:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6288 transitions. [2019-10-02 12:55:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:55:40,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:40,950 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:55:40,950 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 810817844, now seen corresponding path program 1 times [2019-10-02 12:55:40,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:55:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:41,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 12:55:41,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 12:55:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 12:55:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:55:41,588 INFO L87 Difference]: Start difference. First operand 4395 states and 6288 transitions. Second operand 28 states. [2019-10-02 12:55:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:51,567 INFO L93 Difference]: Finished difference Result 11106 states and 15384 transitions. [2019-10-02 12:55:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-02 12:55:51,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 179 [2019-10-02 12:55:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:51,634 INFO L225 Difference]: With dead ends: 11106 [2019-10-02 12:55:51,635 INFO L226 Difference]: Without dead ends: 9743 [2019-10-02 12:55:51,646 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=854, Invalid=8266, Unknown=0, NotChecked=0, Total=9120 [2019-10-02 12:55:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9743 states. [2019-10-02 12:55:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9743 to 8563. [2019-10-02 12:55:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2019-10-02 12:55:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 12074 transitions. [2019-10-02 12:55:52,306 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 12074 transitions. Word has length 179 [2019-10-02 12:55:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 8563 states and 12074 transitions. [2019-10-02 12:55:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 12:55:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 12074 transitions. [2019-10-02 12:55:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:55:52,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:52,330 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:55:52,331 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash 34155047, now seen corresponding path program 2 times [2019-10-02 12:55:52,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:52,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:52,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:55:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-02 12:55:52,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 12:55:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 12:55:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:55:52,981 INFO L87 Difference]: Start difference. First operand 8563 states and 12074 transitions. Second operand 25 states. [2019-10-02 12:56:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:01,018 INFO L93 Difference]: Finished difference Result 15966 states and 22303 transitions. [2019-10-02 12:56:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 12:56:01,019 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2019-10-02 12:56:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:01,075 INFO L225 Difference]: With dead ends: 15966 [2019-10-02 12:56:01,075 INFO L226 Difference]: Without dead ends: 14613 [2019-10-02 12:56:01,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=649, Invalid=5051, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 12:56:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14613 states. [2019-10-02 12:56:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14613 to 13399. [2019-10-02 12:56:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13399 states. [2019-10-02 12:56:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13399 states to 13399 states and 18937 transitions. [2019-10-02 12:56:01,919 INFO L78 Accepts]: Start accepts. Automaton has 13399 states and 18937 transitions. Word has length 178 [2019-10-02 12:56:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:01,920 INFO L475 AbstractCegarLoop]: Abstraction has 13399 states and 18937 transitions. [2019-10-02 12:56:01,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 12:56:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13399 states and 18937 transitions. [2019-10-02 12:56:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:56:01,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:01,963 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:01,963 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1025347645, now seen corresponding path program 1 times [2019-10-02 12:56:01,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:01,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:01,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:56:01,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:56:02,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:56:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:56:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:56:02,186 INFO L87 Difference]: Start difference. First operand 13399 states and 18937 transitions. Second operand 9 states. [2019-10-02 12:56:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:02,689 INFO L93 Difference]: Finished difference Result 14364 states and 20188 transitions. [2019-10-02 12:56:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:56:02,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-10-02 12:56:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:02,710 INFO L225 Difference]: With dead ends: 14364 [2019-10-02 12:56:02,710 INFO L226 Difference]: Without dead ends: 4409 [2019-10-02 12:56:02,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:56:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2019-10-02 12:56:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4405. [2019-10-02 12:56:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4405 states. [2019-10-02 12:56:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6290 transitions. [2019-10-02 12:56:03,118 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6290 transitions. Word has length 181 [2019-10-02 12:56:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:03,119 INFO L475 AbstractCegarLoop]: Abstraction has 4405 states and 6290 transitions. [2019-10-02 12:56:03,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:56:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6290 transitions. [2019-10-02 12:56:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:56:03,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:03,134 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:03,134 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash -208939284, now seen corresponding path program 3 times [2019-10-02 12:56:03,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:03,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:03,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 12:56:03,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 12:56:03,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 12:56:03,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:56:03,588 INFO L87 Difference]: Start difference. First operand 4405 states and 6290 transitions. Second operand 23 states. [2019-10-02 12:56:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:11,931 INFO L93 Difference]: Finished difference Result 10360 states and 14212 transitions. [2019-10-02 12:56:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 12:56:11,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-10-02 12:56:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:11,967 INFO L225 Difference]: With dead ends: 10360 [2019-10-02 12:56:11,967 INFO L226 Difference]: Without dead ends: 9007 [2019-10-02 12:56:11,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=705, Invalid=5301, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 12:56:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2019-10-02 12:56:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 6507. [2019-10-02 12:56:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6507 states. [2019-10-02 12:56:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 9038 transitions. [2019-10-02 12:56:12,330 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 9038 transitions. Word has length 179 [2019-10-02 12:56:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:12,332 INFO L475 AbstractCegarLoop]: Abstraction has 6507 states and 9038 transitions. [2019-10-02 12:56:12,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 12:56:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 9038 transitions. [2019-10-02 12:56:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:56:12,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:12,357 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:12,358 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash 463011295, now seen corresponding path program 1 times [2019-10-02 12:56:12,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:12,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:12,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:56:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:12,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:56:12,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:56:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:56:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:56:12,514 INFO L87 Difference]: Start difference. First operand 6507 states and 9038 transitions. Second operand 7 states. [2019-10-02 12:56:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:13,031 INFO L93 Difference]: Finished difference Result 7470 states and 10287 transitions. [2019-10-02 12:56:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:56:13,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 180 [2019-10-02 12:56:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:13,047 INFO L225 Difference]: With dead ends: 7470 [2019-10-02 12:56:13,047 INFO L226 Difference]: Without dead ends: 2378 [2019-10-02 12:56:13,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:56:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-10-02 12:56:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2378. [2019-10-02 12:56:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-10-02 12:56:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3295 transitions. [2019-10-02 12:56:13,181 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3295 transitions. Word has length 180 [2019-10-02 12:56:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:13,182 INFO L475 AbstractCegarLoop]: Abstraction has 2378 states and 3295 transitions. [2019-10-02 12:56:13,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:56:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3295 transitions. [2019-10-02 12:56:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:56:13,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:13,191 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:13,191 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1864828175, now seen corresponding path program 4 times [2019-10-02 12:56:13,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:13,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:13,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:13,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:13,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-02 12:56:13,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 12:56:13,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 12:56:13,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:56:13,671 INFO L87 Difference]: Start difference. First operand 2378 states and 3295 transitions. Second operand 25 states. [2019-10-02 12:56:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:21,212 INFO L93 Difference]: Finished difference Result 10385 states and 14248 transitions. [2019-10-02 12:56:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 12:56:21,212 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 180 [2019-10-02 12:56:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:21,246 INFO L225 Difference]: With dead ends: 10385 [2019-10-02 12:56:21,247 INFO L226 Difference]: Without dead ends: 9038 [2019-10-02 12:56:21,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=660, Invalid=5192, Unknown=0, NotChecked=0, Total=5852 [2019-10-02 12:56:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9038 states. [2019-10-02 12:56:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9038 to 6534. [2019-10-02 12:56:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6534 states. [2019-10-02 12:56:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 9073 transitions. [2019-10-02 12:56:21,721 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 9073 transitions. Word has length 180 [2019-10-02 12:56:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:21,721 INFO L475 AbstractCegarLoop]: Abstraction has 6534 states and 9073 transitions. [2019-10-02 12:56:21,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 12:56:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 9073 transitions. [2019-10-02 12:56:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:56:21,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:21,742 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:21,742 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 325293084, now seen corresponding path program 2 times [2019-10-02 12:56:21,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:21,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:21,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:56:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:21,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:21,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:56:21,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:56:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:56:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:56:21,933 INFO L87 Difference]: Start difference. First operand 6534 states and 9073 transitions. Second operand 9 states. [2019-10-02 12:56:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:22,345 INFO L93 Difference]: Finished difference Result 7501 states and 10326 transitions. [2019-10-02 12:56:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:56:22,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-10-02 12:56:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:22,352 INFO L225 Difference]: With dead ends: 7501 [2019-10-02 12:56:22,353 INFO L226 Difference]: Without dead ends: 2382 [2019-10-02 12:56:22,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:56:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2019-10-02 12:56:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2378. [2019-10-02 12:56:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-10-02 12:56:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3294 transitions. [2019-10-02 12:56:22,499 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3294 transitions. Word has length 181 [2019-10-02 12:56:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:22,499 INFO L475 AbstractCegarLoop]: Abstraction has 2378 states and 3294 transitions. [2019-10-02 12:56:22,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:56:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3294 transitions. [2019-10-02 12:56:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:56:22,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:22,505 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:22,505 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:22,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1945178471, now seen corresponding path program 1 times [2019-10-02 12:56:22,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:22,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:22,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:22,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:56:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:22,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 12:56:22,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 12:56:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 12:56:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:56:22,970 INFO L87 Difference]: Start difference. First operand 2378 states and 3294 transitions. Second operand 23 states. [2019-10-02 12:56:28,315 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-02 12:56:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:30,822 INFO L93 Difference]: Finished difference Result 11370 states and 15772 transitions. [2019-10-02 12:56:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 12:56:30,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 181 [2019-10-02 12:56:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:30,856 INFO L225 Difference]: With dead ends: 11370 [2019-10-02 12:56:30,856 INFO L226 Difference]: Without dead ends: 9067 [2019-10-02 12:56:30,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=717, Invalid=5445, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 12:56:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-10-02 12:56:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6531. [2019-10-02 12:56:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6531 states. [2019-10-02 12:56:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 9063 transitions. [2019-10-02 12:56:31,295 INFO L78 Accepts]: Start accepts. Automaton has 6531 states and 9063 transitions. Word has length 181 [2019-10-02 12:56:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:31,295 INFO L475 AbstractCegarLoop]: Abstraction has 6531 states and 9063 transitions. [2019-10-02 12:56:31,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 12:56:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6531 states and 9063 transitions. [2019-10-02 12:56:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:56:31,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:31,305 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:31,305 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1820795950, now seen corresponding path program 1 times [2019-10-02 12:56:31,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:56:31,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:31,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:56:31,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:56:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:56:31,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:56:31,472 INFO L87 Difference]: Start difference. First operand 6531 states and 9063 transitions. Second operand 7 states. [2019-10-02 12:56:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:31,775 INFO L93 Difference]: Finished difference Result 7510 states and 10328 transitions. [2019-10-02 12:56:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:56:31,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:56:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:31,783 INFO L225 Difference]: With dead ends: 7510 [2019-10-02 12:56:31,783 INFO L226 Difference]: Without dead ends: 2396 [2019-10-02 12:56:31,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:56:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2019-10-02 12:56:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2380. [2019-10-02 12:56:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2019-10-02 12:56:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3296 transitions. [2019-10-02 12:56:32,060 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3296 transitions. Word has length 182 [2019-10-02 12:56:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:32,060 INFO L475 AbstractCegarLoop]: Abstraction has 2380 states and 3296 transitions. [2019-10-02 12:56:32,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:56:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3296 transitions. [2019-10-02 12:56:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:56:32,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:32,064 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:32,064 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -122875385, now seen corresponding path program 1 times [2019-10-02 12:56:32,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:32,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:32,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:56:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:32,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 12:56:32,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:56:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:56:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:56:32,355 INFO L87 Difference]: Start difference. First operand 2380 states and 3296 transitions. Second operand 17 states. [2019-10-02 12:56:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:36,505 INFO L93 Difference]: Finished difference Result 6639 states and 9008 transitions. [2019-10-02 12:56:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 12:56:36,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 182 [2019-10-02 12:56:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:36,524 INFO L225 Difference]: With dead ends: 6639 [2019-10-02 12:56:36,524 INFO L226 Difference]: Without dead ends: 5292 [2019-10-02 12:56:36,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:56:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2019-10-02 12:56:36,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5194. [2019-10-02 12:56:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-10-02 12:56:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 7110 transitions. [2019-10-02 12:56:36,801 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 7110 transitions. Word has length 182 [2019-10-02 12:56:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:36,801 INFO L475 AbstractCegarLoop]: Abstraction has 5194 states and 7110 transitions. [2019-10-02 12:56:36,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:56:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 7110 transitions. [2019-10-02 12:56:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:56:36,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:36,807 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:36,807 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1163975132, now seen corresponding path program 1 times [2019-10-02 12:56:36,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:36,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:36,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:36,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:36,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:56:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:56:36,936 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 12:56:37,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:37,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:56:37,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:56:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:56:37,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:56:37,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:56:37,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:56:37,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:56:37,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:56:37,611 INFO L87 Difference]: Start difference. First operand 5194 states and 7110 transitions. Second operand 5 states. [2019-10-02 12:56:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:37,900 INFO L93 Difference]: Finished difference Result 7712 states and 10382 transitions. [2019-10-02 12:56:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:56:37,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-02 12:56:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:37,921 INFO L225 Difference]: With dead ends: 7712 [2019-10-02 12:56:37,921 INFO L226 Difference]: Without dead ends: 5267 [2019-10-02 12:56:37,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:56:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2019-10-02 12:56:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5259. [2019-10-02 12:56:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5259 states. [2019-10-02 12:56:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5259 states to 5259 states and 7216 transitions. [2019-10-02 12:56:38,215 INFO L78 Accepts]: Start accepts. Automaton has 5259 states and 7216 transitions. Word has length 183 [2019-10-02 12:56:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:38,216 INFO L475 AbstractCegarLoop]: Abstraction has 5259 states and 7216 transitions. [2019-10-02 12:56:38,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:56:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 7216 transitions. [2019-10-02 12:56:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:56:38,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:38,222 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:56:38,223 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash 481979751, now seen corresponding path program 1 times [2019-10-02 12:56:38,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:38,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:38,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:38,360 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 12:56:38,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:38,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:38,362 INFO L87 Difference]: Start difference. First operand 5259 states and 7216 transitions. Second operand 3 states. [2019-10-02 12:56:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:38,565 INFO L93 Difference]: Finished difference Result 10886 states and 15193 transitions. [2019-10-02 12:56:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:38,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-02 12:56:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:38,580 INFO L225 Difference]: With dead ends: 10886 [2019-10-02 12:56:38,581 INFO L226 Difference]: Without dead ends: 5729 [2019-10-02 12:56:38,590 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 12:56:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2019-10-02 12:56:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5723. [2019-10-02 12:56:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5723 states. [2019-10-02 12:56:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 8075 transitions. [2019-10-02 12:56:38,846 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 8075 transitions. Word has length 189 [2019-10-02 12:56:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:38,847 INFO L475 AbstractCegarLoop]: Abstraction has 5723 states and 8075 transitions. [2019-10-02 12:56:38,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 8075 transitions. [2019-10-02 12:56:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:56:38,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:38,854 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:38,854 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:38,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:38,854 INFO L82 PathProgramCache]: Analyzing trace with hash 993469983, now seen corresponding path program 2 times [2019-10-02 12:56:38,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:38,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:38,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:38,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:56:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:56:39,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:56:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:56:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:56:39,149 INFO L87 Difference]: Start difference. First operand 5723 states and 8075 transitions. Second operand 6 states. [2019-10-02 12:56:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:39,417 INFO L93 Difference]: Finished difference Result 11298 states and 15953 transitions. [2019-10-02 12:56:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:56:39,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-02 12:56:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:39,435 INFO L225 Difference]: With dead ends: 11298 [2019-10-02 12:56:39,435 INFO L226 Difference]: Without dead ends: 5729 [2019-10-02 12:56:39,447 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 12:56:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2019-10-02 12:56:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5723. [2019-10-02 12:56:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5723 states. [2019-10-02 12:56:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 8063 transitions. [2019-10-02 12:56:39,823 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 8063 transitions. Word has length 190 [2019-10-02 12:56:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:39,823 INFO L475 AbstractCegarLoop]: Abstraction has 5723 states and 8063 transitions. [2019-10-02 12:56:39,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:56:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 8063 transitions. [2019-10-02 12:56:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:56:39,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:39,832 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:39,832 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1792709614, now seen corresponding path program 1 times [2019-10-02 12:56:39,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:39,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:56:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:39,978 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 12:56:39,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:39,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:39,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:39,980 INFO L87 Difference]: Start difference. First operand 5723 states and 8063 transitions. Second operand 3 states. [2019-10-02 12:56:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:40,313 INFO L93 Difference]: Finished difference Result 12210 states and 17629 transitions. [2019-10-02 12:56:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:40,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 12:56:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:40,336 INFO L225 Difference]: With dead ends: 12210 [2019-10-02 12:56:40,336 INFO L226 Difference]: Without dead ends: 6595 [2019-10-02 12:56:40,349 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 12:56:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2019-10-02 12:56:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 6589. [2019-10-02 12:56:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6589 states. [2019-10-02 12:56:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6589 states to 6589 states and 9660 transitions. [2019-10-02 12:56:40,772 INFO L78 Accepts]: Start accepts. Automaton has 6589 states and 9660 transitions. Word has length 190 [2019-10-02 12:56:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:40,772 INFO L475 AbstractCegarLoop]: Abstraction has 6589 states and 9660 transitions. [2019-10-02 12:56:40,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6589 states and 9660 transitions. [2019-10-02 12:56:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:56:40,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:40,784 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:40,784 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash -961104983, now seen corresponding path program 1 times [2019-10-02 12:56:40,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:40,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:40,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:40,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:40,896 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 12:56:40,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:40,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:40,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:40,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:40,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:40,898 INFO L87 Difference]: Start difference. First operand 6589 states and 9660 transitions. Second operand 3 states. [2019-10-02 12:56:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:41,279 INFO L93 Difference]: Finished difference Result 14730 states and 22243 transitions. [2019-10-02 12:56:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:41,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-02 12:56:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:41,303 INFO L225 Difference]: With dead ends: 14730 [2019-10-02 12:56:41,303 INFO L226 Difference]: Without dead ends: 8257 [2019-10-02 12:56:41,317 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 12:56:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8257 states. [2019-10-02 12:56:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8257 to 8251. [2019-10-02 12:56:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8251 states. [2019-10-02 12:56:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 12665 transitions. [2019-10-02 12:56:41,734 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 12665 transitions. Word has length 191 [2019-10-02 12:56:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:41,735 INFO L475 AbstractCegarLoop]: Abstraction has 8251 states and 12665 transitions. [2019-10-02 12:56:41,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 12665 transitions. [2019-10-02 12:56:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:56:41,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:41,754 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:56:41,754 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1849706926, now seen corresponding path program 1 times [2019-10-02 12:56:41,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:41,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:41,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:41,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:41,883 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 12:56:41,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:41,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:41,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:41,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:41,885 INFO L87 Difference]: Start difference. First operand 8251 states and 12665 transitions. Second operand 3 states. [2019-10-02 12:56:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:42,266 INFO L93 Difference]: Finished difference Result 19554 states and 30949 transitions. [2019-10-02 12:56:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:42,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 12:56:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:42,301 INFO L225 Difference]: With dead ends: 19554 [2019-10-02 12:56:42,301 INFO L226 Difference]: Without dead ends: 11431 [2019-10-02 12:56:42,321 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 12:56:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2019-10-02 12:56:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 11425. [2019-10-02 12:56:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11425 states. [2019-10-02 12:56:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11425 states to 11425 states and 18334 transitions. [2019-10-02 12:56:43,032 INFO L78 Accepts]: Start accepts. Automaton has 11425 states and 18334 transitions. Word has length 192 [2019-10-02 12:56:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:43,032 INFO L475 AbstractCegarLoop]: Abstraction has 11425 states and 18334 transitions. [2019-10-02 12:56:43,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 11425 states and 18334 transitions. [2019-10-02 12:56:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:56:43,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:43,059 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:56:43,059 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 665217513, now seen corresponding path program 1 times [2019-10-02 12:56:43,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:43,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:43,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:43,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:43,169 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 12:56:43,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:43,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:43,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:43,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:43,171 INFO L87 Difference]: Start difference. First operand 11425 states and 18334 transitions. Second operand 3 states. [2019-10-02 12:56:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:43,946 INFO L93 Difference]: Finished difference Result 29154 states and 48130 transitions. [2019-10-02 12:56:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:43,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 12:56:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:43,997 INFO L225 Difference]: With dead ends: 29154 [2019-10-02 12:56:43,997 INFO L226 Difference]: Without dead ends: 17865 [2019-10-02 12:56:44,021 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 12:56:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2019-10-02 12:56:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17859. [2019-10-02 12:56:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17859 states. [2019-10-02 12:56:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17859 states to 17859 states and 29759 transitions. [2019-10-02 12:56:45,047 INFO L78 Accepts]: Start accepts. Automaton has 17859 states and 29759 transitions. Word has length 193 [2019-10-02 12:56:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:45,048 INFO L475 AbstractCegarLoop]: Abstraction has 17859 states and 29759 transitions. [2019-10-02 12:56:45,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 17859 states and 29759 transitions. [2019-10-02 12:56:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:56:45,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:45,082 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:56:45,082 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 721561454, now seen corresponding path program 1 times [2019-10-02 12:56:45,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:45,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:45,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:45,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:45,189 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 12:56:45,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:45,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:45,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:45,191 INFO L87 Difference]: Start difference. First operand 17859 states and 29759 transitions. Second operand 3 states. [2019-10-02 12:56:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:46,392 INFO L93 Difference]: Finished difference Result 47489 states and 80668 transitions. [2019-10-02 12:56:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:46,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 12:56:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:46,478 INFO L225 Difference]: With dead ends: 47489 [2019-10-02 12:56:46,478 INFO L226 Difference]: Without dead ends: 29773 [2019-10-02 12:56:46,510 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 12:56:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29773 states. [2019-10-02 12:56:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 29767. [2019-10-02 12:56:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29767 states. [2019-10-02 12:56:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29767 states to 29767 states and 50690 transitions. [2019-10-02 12:56:49,471 INFO L78 Accepts]: Start accepts. Automaton has 29767 states and 50690 transitions. Word has length 194 [2019-10-02 12:56:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:49,471 INFO L475 AbstractCegarLoop]: Abstraction has 29767 states and 50690 transitions. [2019-10-02 12:56:49,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29767 states and 50690 transitions. [2019-10-02 12:56:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:56:49,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:49,557 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:49,558 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1109506029, now seen corresponding path program 1 times [2019-10-02 12:56:49,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:49,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:56:49,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:56:49,681 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 12:56:49,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:50,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:56:50,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:56:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:56:50,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:56:50,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 12:56:50,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:56:50,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:56:50,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:56:50,262 INFO L87 Difference]: Start difference. First operand 29767 states and 50690 transitions. Second operand 6 states. [2019-10-02 12:56:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:51,523 INFO L93 Difference]: Finished difference Result 34726 states and 57445 transitions. [2019-10-02 12:56:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:56:51,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 12:56:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:51,593 INFO L225 Difference]: With dead ends: 34726 [2019-10-02 12:56:51,594 INFO L226 Difference]: Without dead ends: 30839 [2019-10-02 12:56:51,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:56:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30839 states. [2019-10-02 12:56:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30839 to 30729. [2019-10-02 12:56:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30729 states. [2019-10-02 12:56:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30729 states to 30729 states and 52195 transitions. [2019-10-02 12:56:53,314 INFO L78 Accepts]: Start accepts. Automaton has 30729 states and 52195 transitions. Word has length 201 [2019-10-02 12:56:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:53,314 INFO L475 AbstractCegarLoop]: Abstraction has 30729 states and 52195 transitions. [2019-10-02 12:56:53,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:56:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30729 states and 52195 transitions. [2019-10-02 12:56:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:56:53,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:53,378 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:56:53,378 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1532727531, now seen corresponding path program 1 times [2019-10-02 12:56:53,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:53,476 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 12:56:53,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:53,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:53,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:53,478 INFO L87 Difference]: Start difference. First operand 30729 states and 52195 transitions. Second operand 3 states. [2019-10-02 12:56:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:56,573 INFO L93 Difference]: Finished difference Result 85087 states and 146404 transitions. [2019-10-02 12:56:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:56:56,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-02 12:56:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:56,719 INFO L225 Difference]: With dead ends: 85087 [2019-10-02 12:56:56,719 INFO L226 Difference]: Without dead ends: 55015 [2019-10-02 12:56:56,773 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 12:56:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55015 states. [2019-10-02 12:56:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55015 to 55009. [2019-10-02 12:56:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55009 states. [2019-10-02 12:56:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55009 states to 55009 states and 94346 transitions. [2019-10-02 12:56:59,405 INFO L78 Accepts]: Start accepts. Automaton has 55009 states and 94346 transitions. Word has length 195 [2019-10-02 12:56:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:59,405 INFO L475 AbstractCegarLoop]: Abstraction has 55009 states and 94346 transitions. [2019-10-02 12:56:59,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:56:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 55009 states and 94346 transitions. [2019-10-02 12:56:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:56:59,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:59,515 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:56:59,515 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash -697350802, now seen corresponding path program 1 times [2019-10-02 12:56:59,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:59,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:59,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:59,623 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 12:56:59,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:59,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:56:59,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:56:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:56:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:56:59,624 INFO L87 Difference]: Start difference. First operand 55009 states and 94346 transitions. Second operand 3 states. [2019-10-02 12:57:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:03,683 INFO L93 Difference]: Finished difference Result 153956 states and 264999 transitions. [2019-10-02 12:57:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:03,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 12:57:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:03,947 INFO L225 Difference]: With dead ends: 153956 [2019-10-02 12:57:03,947 INFO L226 Difference]: Without dead ends: 99745 [2019-10-02 12:57:04,030 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 12:57:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99745 states. [2019-10-02 12:57:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99745 to 99739. [2019-10-02 12:57:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99739 states. [2019-10-02 12:57:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99739 states to 99739 states and 170238 transitions. [2019-10-02 12:57:13,472 INFO L78 Accepts]: Start accepts. Automaton has 99739 states and 170238 transitions. Word has length 196 [2019-10-02 12:57:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:13,472 INFO L475 AbstractCegarLoop]: Abstraction has 99739 states and 170238 transitions. [2019-10-02 12:57:13,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 99739 states and 170238 transitions. [2019-10-02 12:57:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:57:13,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:13,657 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:13,657 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2052966445, now seen corresponding path program 1 times [2019-10-02 12:57:13,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:13,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:13,763 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 12:57:13,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:13,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:13,765 INFO L87 Difference]: Start difference. First operand 99739 states and 170238 transitions. Second operand 3 states. [2019-10-02 12:57:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:23,773 INFO L93 Difference]: Finished difference Result 282973 states and 484198 transitions. [2019-10-02 12:57:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:23,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 12:57:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:24,256 INFO L225 Difference]: With dead ends: 282973 [2019-10-02 12:57:24,257 INFO L226 Difference]: Without dead ends: 184347 [2019-10-02 12:57:24,391 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 12:57:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184347 states. [2019-10-02 12:57:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184347 to 184341. [2019-10-02 12:57:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184341 states. [2019-10-02 12:57:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184341 states to 184341 states and 312460 transitions. [2019-10-02 12:57:37,491 INFO L78 Accepts]: Start accepts. Automaton has 184341 states and 312460 transitions. Word has length 197 [2019-10-02 12:57:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:37,492 INFO L475 AbstractCegarLoop]: Abstraction has 184341 states and 312460 transitions. [2019-10-02 12:57:37,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 184341 states and 312460 transitions. [2019-10-02 12:57:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:57:37,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:37,762 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:57:37,763 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -563633234, now seen corresponding path program 1 times [2019-10-02 12:57:37,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:37,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:37,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:37,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:37,875 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 12:57:37,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:37,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:37,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:37,877 INFO L87 Difference]: Start difference. First operand 184341 states and 312460 transitions. Second operand 3 states. [2019-10-02 12:57:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:55,314 INFO L93 Difference]: Finished difference Result 344882 states and 579818 transitions. [2019-10-02 12:57:55,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:55,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 12:57:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:56,270 INFO L225 Difference]: With dead ends: 344882 [2019-10-02 12:57:56,271 INFO L226 Difference]: Without dead ends: 340995 [2019-10-02 12:57:56,358 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 12:57:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340995 states. [2019-10-02 12:58:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340995 to 340989. [2019-10-02 12:58:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340989 states. [2019-10-02 12:58:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340989 states to 340989 states and 568608 transitions. [2019-10-02 12:58:27,595 INFO L78 Accepts]: Start accepts. Automaton has 340989 states and 568608 transitions. Word has length 198 [2019-10-02 12:58:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:27,596 INFO L475 AbstractCegarLoop]: Abstraction has 340989 states and 568608 transitions. [2019-10-02 12:58:27,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 340989 states and 568608 transitions. [2019-10-02 12:58:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:58:27,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:27,944 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:58:27,945 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1663493613, now seen corresponding path program 1 times [2019-10-02 12:58:27,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:28,099 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 12:58:28,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:28,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:28,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:28,101 INFO L87 Difference]: Start difference. First operand 340989 states and 568608 transitions. Second operand 3 states. [2019-10-02 12:58:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:48,847 INFO L93 Difference]: Finished difference Result 345586 states and 574743 transitions. [2019-10-02 12:58:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:48,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 12:58:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:50,698 INFO L225 Difference]: With dead ends: 345586 [2019-10-02 12:58:50,698 INFO L226 Difference]: Without dead ends: 341965 [2019-10-02 12:58:50,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341965 states. [2019-10-02 12:59:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341965 to 340589. [2019-10-02 12:59:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340589 states. [2019-10-02 12:59:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340589 states to 340589 states and 568069 transitions. [2019-10-02 12:59:30,996 INFO L78 Accepts]: Start accepts. Automaton has 340589 states and 568069 transitions. Word has length 199 [2019-10-02 12:59:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:30,996 INFO L475 AbstractCegarLoop]: Abstraction has 340589 states and 568069 transitions. [2019-10-02 12:59:30,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 340589 states and 568069 transitions. [2019-10-02 12:59:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 12:59:32,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:32,546 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:32,547 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:32,547 INFO L82 PathProgramCache]: Analyzing trace with hash 814822771, now seen corresponding path program 1 times [2019-10-02 12:59:32,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:32,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 12:59:32,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:32,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:59:32,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:32,747 INFO L87 Difference]: Start difference. First operand 340589 states and 568069 transitions. Second operand 5 states. [2019-10-02 12:59:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:55,407 INFO L93 Difference]: Finished difference Result 341206 states and 568863 transitions. [2019-10-02 12:59:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:59:55,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-10-02 12:59:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:56,668 INFO L225 Difference]: With dead ends: 341206 [2019-10-02 12:59:56,668 INFO L226 Difference]: Without dead ends: 339355 [2019-10-02 12:59:56,759 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 12:59:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339355 states. [2019-10-02 13:00:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339355 to 339085. [2019-10-02 13:00:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339085 states. [2019-10-02 13:00:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339085 states to 339085 states and 566113 transitions. [2019-10-02 13:00:31,724 INFO L78 Accepts]: Start accepts. Automaton has 339085 states and 566113 transitions. Word has length 358 [2019-10-02 13:00:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:31,724 INFO L475 AbstractCegarLoop]: Abstraction has 339085 states and 566113 transitions. [2019-10-02 13:00:31,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:00:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 339085 states and 566113 transitions. [2019-10-02 13:00:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-10-02 13:00:41,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:41,917 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:41,917 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1796676209, now seen corresponding path program 1 times [2019-10-02 13:00:41,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:41,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 13:00:42,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:00:42,165 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:00:42,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:42,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 3315 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:00:42,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:00:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:00:43,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:00:43,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 13:00:43,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:00:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:00:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:00:43,003 INFO L87 Difference]: Start difference. First operand 339085 states and 566113 transitions. Second operand 13 states. [2019-10-02 13:01:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:10,259 INFO L93 Difference]: Finished difference Result 354397 states and 589325 transitions. [2019-10-02 13:01:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 13:01:10,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 359 [2019-10-02 13:01:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:11,367 INFO L225 Difference]: With dead ends: 354397 [2019-10-02 13:01:11,368 INFO L226 Difference]: Without dead ends: 352348 [2019-10-02 13:01:11,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:01:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352348 states. [2019-10-02 13:01:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352348 to 352126. [2019-10-02 13:01:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352126 states. [2019-10-02 13:01:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352126 states to 352126 states and 585387 transitions. [2019-10-02 13:01:47,244 INFO L78 Accepts]: Start accepts. Automaton has 352126 states and 585387 transitions. Word has length 359 [2019-10-02 13:01:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:47,245 INFO L475 AbstractCegarLoop]: Abstraction has 352126 states and 585387 transitions. [2019-10-02 13:01:47,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:01:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 352126 states and 585387 transitions. [2019-10-02 13:01:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 13:01:58,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:58,890 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:01:58,890 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1645238718, now seen corresponding path program 1 times [2019-10-02 13:01:58,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 13:01:59,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:01:59,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:01:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:59,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:01:59,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:02:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 13:02:00,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:02:00,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 13:02:00,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:02:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:02:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:02:00,214 INFO L87 Difference]: Start difference. First operand 352126 states and 585387 transitions. Second operand 29 states. [2019-10-02 13:02:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:22,663 INFO L93 Difference]: Finished difference Result 490665 states and 816754 transitions. [2019-10-02 13:02:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 13:02:22,664 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 364 [2019-10-02 13:02:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:23,590 INFO L225 Difference]: With dead ends: 490665 [2019-10-02 13:02:23,591 INFO L226 Difference]: Without dead ends: 316894 [2019-10-02 13:02:23,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=2995, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 13:02:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316894 states. [2019-10-02 13:02:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316894 to 316836. [2019-10-02 13:02:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316836 states. [2019-10-02 13:02:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316836 states to 316836 states and 525522 transitions. [2019-10-02 13:02:55,021 INFO L78 Accepts]: Start accepts. Automaton has 316836 states and 525522 transitions. Word has length 364 [2019-10-02 13:02:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:55,022 INFO L475 AbstractCegarLoop]: Abstraction has 316836 states and 525522 transitions. [2019-10-02 13:02:55,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:02:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 316836 states and 525522 transitions. [2019-10-02 13:02:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 13:02:56,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:56,503 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:56,503 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1627719912, now seen corresponding path program 1 times [2019-10-02 13:02:56,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:56,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 13:02:58,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:02:58,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:02:58,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:58,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 3226 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 13:02:58,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:02:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 13:02:59,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:02:59,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2019-10-02 13:02:59,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:02:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:02:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:02:59,143 INFO L87 Difference]: Start difference. First operand 316836 states and 525522 transitions. Second operand 25 states. [2019-10-02 13:03:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:30,325 INFO L93 Difference]: Finished difference Result 320041 states and 529776 transitions. [2019-10-02 13:03:30,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 13:03:30,325 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 334 [2019-10-02 13:03:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:31,805 INFO L225 Difference]: With dead ends: 320041 [2019-10-02 13:03:31,805 INFO L226 Difference]: Without dead ends: 317198 [2019-10-02 13:03:31,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=340, Invalid=3692, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 13:03:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317198 states. [2019-10-02 13:04:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317198 to 317050. [2019-10-02 13:04:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317050 states. [2019-10-02 13:04:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317050 states to 317050 states and 525870 transitions. [2019-10-02 13:04:03,937 INFO L78 Accepts]: Start accepts. Automaton has 317050 states and 525870 transitions. Word has length 334 [2019-10-02 13:04:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:03,938 INFO L475 AbstractCegarLoop]: Abstraction has 317050 states and 525870 transitions. [2019-10-02 13:04:03,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:04:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 317050 states and 525870 transitions. [2019-10-02 13:04:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-02 13:04:05,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:05,480 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:05,480 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -217818284, now seen corresponding path program 1 times [2019-10-02 13:04:05,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:05,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 13:04:05,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:05,783 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:04:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:06,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 3247 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 13:04:06,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 13:04:06,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:04:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2019-10-02 13:04:06,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:04:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:04:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:04:06,775 INFO L87 Difference]: Start difference. First operand 317050 states and 525870 transitions. Second operand 30 states. [2019-10-02 13:04:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:29,046 INFO L93 Difference]: Finished difference Result 321292 states and 531874 transitions. [2019-10-02 13:04:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 13:04:29,046 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 342 [2019-10-02 13:04:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:30,121 INFO L225 Difference]: With dead ends: 321292 [2019-10-02 13:04:30,122 INFO L226 Difference]: Without dead ends: 317192 [2019-10-02 13:04:30,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:04:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317192 states. [2019-10-02 13:05:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317192 to 316828. [2019-10-02 13:05:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316828 states. [2019-10-02 13:05:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316828 states to 316828 states and 525469 transitions. [2019-10-02 13:05:01,920 INFO L78 Accepts]: Start accepts. Automaton has 316828 states and 525469 transitions. Word has length 342 [2019-10-02 13:05:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:05:01,921 INFO L475 AbstractCegarLoop]: Abstraction has 316828 states and 525469 transitions. [2019-10-02 13:05:01,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:05:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 316828 states and 525469 transitions. [2019-10-02 13:05:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 13:05:03,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:03,200 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 13:05:03,200 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash -603247347, now seen corresponding path program 1 times [2019-10-02 13:05:03,201 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:03,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 13:05:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:03,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:05:03,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:05:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:05:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:05:03,421 INFO L87 Difference]: Start difference. First operand 316828 states and 525469 transitions. Second operand 10 states. [2019-10-02 13:05:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:19,373 INFO L93 Difference]: Finished difference Result 318035 states and 526989 transitions. [2019-10-02 13:05:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:05:19,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 370 [2019-10-02 13:05:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:20,446 INFO L225 Difference]: With dead ends: 318035 [2019-10-02 13:05:20,447 INFO L226 Difference]: Without dead ends: 316828 [2019-10-02 13:05:20,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:05:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316828 states.