java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:39:24,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:39:24,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:39:24,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:39:24,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:39:24,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:39:24,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:39:24,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:39:24,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:39:24,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:39:24,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:39:24,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:39:24,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:39:24,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:39:24,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:39:24,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:39:24,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:39:24,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:39:24,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:39:24,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:39:24,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:39:24,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:39:24,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:39:24,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:39:24,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:39:24,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:39:24,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:39:24,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:39:24,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:39:24,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:39:24,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:39:24,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:39:24,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:39:24,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:39:24,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:39:24,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:39:24,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:39:24,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:39:24,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:39:24,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:39:24,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:39:24,923 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-09-08 05:39:24,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:39:24,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:39:24,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:39:24,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:39:24,940 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:39:24,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:39:24,940 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:39:24,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:39:24,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:39:24,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:39:24,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:39:24,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:39:24,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:39:24,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:39:24,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:39:24,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:39:24,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:39:24,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:39:24,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:39:24,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:39:24,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:39:24,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:39:24,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:39:24,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:39:24,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:39:24,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:39:24,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:39:24,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:39:24,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:39:24,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:39:24,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:39:24,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:39:24,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:39:24,994 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:39:24,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-09-08 05:39:25,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c063981d2/5a13ab0c50094cada338ca8451454695/FLAGc4852b27a [2019-09-08 05:39:25,736 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:39:25,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product14.cil.c [2019-09-08 05:39:25,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c063981d2/5a13ab0c50094cada338ca8451454695/FLAGc4852b27a [2019-09-08 05:39:25,901 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c063981d2/5a13ab0c50094cada338ca8451454695 [2019-09-08 05:39:25,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:39:25,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:39:25,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:39:25,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:39:25,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:39:25,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:39:25" (1/1) ... [2019-09-08 05:39:25,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c543f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:25, skipping insertion in model container [2019-09-08 05:39:25,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:39:25" (1/1) ... [2019-09-08 05:39:25,929 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:39:26,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:39:26,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:39:26,851 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:39:27,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:39:27,122 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:39:27,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27 WrapperNode [2019-09-08 05:39:27,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:39:27,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:39:27,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:39:27,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:39:27,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (1/1) ... [2019-09-08 05:39:27,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:39:27,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:39:27,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:39:27,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:39:27,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (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-09-08 05:39:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:39:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:39:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:39:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:39:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:39:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:39:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:39:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:39:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:39:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:39:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:39:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:39:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:39:27,381 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:39:27,381 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:39:27,381 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-09-08 05:39:27,381 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:39:27,382 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:39:27,382 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:39:27,382 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:39:27,382 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:39:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:39:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:39:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:39:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:39:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:39:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:39:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:39:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:39:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:39:27,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:39:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:39:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:39:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:39:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:39:27,385 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:39:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:39:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:39:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:39:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:39:27,386 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:39:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:39:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:39:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:39:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:39:27,387 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:39:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:39:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:39:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:39:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:39:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:39:27,389 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:39:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:39:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:39:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:39:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:39:27,390 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:39:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:39:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:39:27,393 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:39:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:39:27,395 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:39:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:39:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:39:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:39:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:39:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:39:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:39:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:39:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:39:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:39:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:39:27,401 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:39:27,402 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:39:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:39:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:39:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-09-08 05:39:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:39:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:39:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:39:27,409 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:39:27,410 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:39:27,411 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:39:27,412 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:39:27,413 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:39:27,414 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:39:27,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:39:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:39:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:39:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:39:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:39:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:39:29,374 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:39:29,374 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:39:29,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:39:29 BoogieIcfgContainer [2019-09-08 05:39:29,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:39:29,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:39:29,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:39:29,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:39:29,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:39:25" (1/3) ... [2019-09-08 05:39:29,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d75325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:39:29, skipping insertion in model container [2019-09-08 05:39:29,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:39:27" (2/3) ... [2019-09-08 05:39:29,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d75325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:39:29, skipping insertion in model container [2019-09-08 05:39:29,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:39:29" (3/3) ... [2019-09-08 05:39:29,384 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product14.cil.c [2019-09-08 05:39:29,395 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:39:29,407 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:39:29,425 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:39:29,471 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:39:29,472 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:39:29,472 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:39:29,472 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:39:29,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:39:29,473 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:39:29,473 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:39:29,473 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:39:29,473 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:39:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states. [2019-09-08 05:39:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 05:39:29,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:29,547 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:29,550 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash 601456659, now seen corresponding path program 1 times [2019-09-08 05:39:29,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:29,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:29,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:29,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:39:30,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:30,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:39:30,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:39:30,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:39:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:39:30,210 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 2 states. [2019-09-08 05:39:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:30,310 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2019-09-08 05:39:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:39:30,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-09-08 05:39:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:30,349 INFO L225 Difference]: With dead ends: 695 [2019-09-08 05:39:30,349 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 05:39:30,359 INFO L628 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-09-08 05:39:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 05:39:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-08 05:39:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-08 05:39:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 651 transitions. [2019-09-08 05:39:30,514 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 651 transitions. Word has length 154 [2019-09-08 05:39:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:30,518 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 651 transitions. [2019-09-08 05:39:30,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:39:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 651 transitions. [2019-09-08 05:39:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 05:39:30,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:30,532 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:30,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:30,534 INFO L82 PathProgramCache]: Analyzing trace with hash -855609359, now seen corresponding path program 1 times [2019-09-08 05:39:30,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:30,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:30,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:30,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:39:30,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:30,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:30,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:30,897 INFO L87 Difference]: Start difference. First operand 470 states and 651 transitions. Second operand 3 states. [2019-09-08 05:39:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:30,948 INFO L93 Difference]: Finished difference Result 678 states and 924 transitions. [2019-09-08 05:39:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:30,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 05:39:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:30,956 INFO L225 Difference]: With dead ends: 678 [2019-09-08 05:39:30,957 INFO L226 Difference]: Without dead ends: 473 [2019-09-08 05:39:30,962 INFO L628 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-09-08 05:39:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-08 05:39:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2019-09-08 05:39:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-08 05:39:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 653 transitions. [2019-09-08 05:39:30,991 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 653 transitions. Word has length 155 [2019-09-08 05:39:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:30,992 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 653 transitions. [2019-09-08 05:39:30,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 653 transitions. [2019-09-08 05:39:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 05:39:30,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:30,996 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:30,996 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 85272997, now seen corresponding path program 1 times [2019-09-08 05:39:30,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:30,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:39:31,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:31,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:31,166 INFO L87 Difference]: Start difference. First operand 472 states and 653 transitions. Second operand 3 states. [2019-09-08 05:39:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:31,201 INFO L93 Difference]: Finished difference Result 920 states and 1304 transitions. [2019-09-08 05:39:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:31,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 05:39:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:31,205 INFO L225 Difference]: With dead ends: 920 [2019-09-08 05:39:31,206 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 05:39:31,207 INFO L628 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-09-08 05:39:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 05:39:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-09-08 05:39:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-08 05:39:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 722 transitions. [2019-09-08 05:39:31,229 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 722 transitions. Word has length 161 [2019-09-08 05:39:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:31,230 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 722 transitions. [2019-09-08 05:39:31,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 722 transitions. [2019-09-08 05:39:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 05:39:31,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:31,234 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:31,234 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash 549891817, now seen corresponding path program 1 times [2019-09-08 05:39:31,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:31,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:39:31,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:39:31,467 INFO L223 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) [2019-09-08 05:39:31,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:39:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:31,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:39:32,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:39:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 05:39:32,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:39:32,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:39:32,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:39:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:39:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:39:32,302 INFO L87 Difference]: Start difference. First operand 512 states and 722 transitions. Second operand 13 states. [2019-09-08 05:39:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:34,265 INFO L93 Difference]: Finished difference Result 1006 states and 1434 transitions. [2019-09-08 05:39:34,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:39:34,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 162 [2019-09-08 05:39:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:34,271 INFO L225 Difference]: With dead ends: 1006 [2019-09-08 05:39:34,272 INFO L226 Difference]: Without dead ends: 530 [2019-09-08 05:39:34,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:39:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-08 05:39:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2019-09-08 05:39:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-09-08 05:39:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 743 transitions. [2019-09-08 05:39:34,300 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 743 transitions. Word has length 162 [2019-09-08 05:39:34,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:34,301 INFO L475 AbstractCegarLoop]: Abstraction has 528 states and 743 transitions. [2019-09-08 05:39:34,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:39:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 743 transitions. [2019-09-08 05:39:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 05:39:34,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:34,305 INFO L399 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] [2019-09-08 05:39:34,305 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:34,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -720765904, now seen corresponding path program 1 times [2019-09-08 05:39:34,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:34,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:39:34,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:34,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:39:34,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:39:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:39:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:39:34,495 INFO L87 Difference]: Start difference. First operand 528 states and 743 transitions. Second operand 7 states. [2019-09-08 05:39:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:34,832 INFO L93 Difference]: Finished difference Result 1004 states and 1423 transitions. [2019-09-08 05:39:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:39:34,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-09-08 05:39:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:34,838 INFO L225 Difference]: With dead ends: 1004 [2019-09-08 05:39:34,839 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 05:39:34,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:39:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 05:39:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2019-09-08 05:39:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-09-08 05:39:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-09-08 05:39:34,886 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 164 [2019-09-08 05:39:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:34,887 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-09-08 05:39:34,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:39:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-09-08 05:39:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 05:39:34,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:34,891 INFO L399 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] [2019-09-08 05:39:34,891 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -166428963, now seen corresponding path program 2 times [2019-09-08 05:39:34,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:34,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:34,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:34,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:39:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:35,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:39:35,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:39:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:39:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:39:35,078 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 7 states. [2019-09-08 05:39:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:35,354 INFO L93 Difference]: Finished difference Result 1002 states and 1422 transitions. [2019-09-08 05:39:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:39:35,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-09-08 05:39:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:35,360 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 05:39:35,360 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 05:39:35,363 INFO L628 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-09-08 05:39:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 05:39:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-09-08 05:39:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 05:39:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 757 transitions. [2019-09-08 05:39:35,401 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 757 transitions. Word has length 165 [2019-09-08 05:39:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:35,402 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 757 transitions. [2019-09-08 05:39:35,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:39:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 757 transitions. [2019-09-08 05:39:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 05:39:35,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:35,406 INFO L399 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] [2019-09-08 05:39:35,406 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash -718340715, now seen corresponding path program 1 times [2019-09-08 05:39:35,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:35,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:35,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:39:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:39:35,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:35,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:39:35,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:39:35,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:39:35,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:39:35,616 INFO L87 Difference]: Start difference. First operand 540 states and 757 transitions. Second operand 9 states. [2019-09-08 05:39:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:35,922 INFO L93 Difference]: Finished difference Result 1007 states and 1428 transitions. [2019-09-08 05:39:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:39:35,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-09-08 05:39:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:35,926 INFO L225 Difference]: With dead ends: 1007 [2019-09-08 05:39:35,926 INFO L226 Difference]: Without dead ends: 542 [2019-09-08 05:39:35,928 INFO L628 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-09-08 05:39:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-09-08 05:39:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2019-09-08 05:39:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 05:39:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 756 transitions. [2019-09-08 05:39:35,951 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 756 transitions. Word has length 166 [2019-09-08 05:39:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:35,951 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 756 transitions. [2019-09-08 05:39:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:39:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 756 transitions. [2019-09-08 05:39:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:39:35,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:35,955 INFO L399 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] [2019-09-08 05:39:35,955 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash 107181255, now seen corresponding path program 2 times [2019-09-08 05:39:35,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:35,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:35,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:35,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:35,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:39:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:39:36,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:39:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:39:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:39:36,203 INFO L87 Difference]: Start difference. First operand 540 states and 756 transitions. Second operand 9 states. [2019-09-08 05:39:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:36,529 INFO L93 Difference]: Finished difference Result 1009 states and 1429 transitions. [2019-09-08 05:39:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:39:36,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 05:39:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:36,534 INFO L225 Difference]: With dead ends: 1009 [2019-09-08 05:39:36,534 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 05:39:36,536 INFO L628 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-09-08 05:39:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 05:39:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-09-08 05:39:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 05:39:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 755 transitions. [2019-09-08 05:39:36,561 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 755 transitions. Word has length 167 [2019-09-08 05:39:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:36,562 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 755 transitions. [2019-09-08 05:39:36,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:39:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 755 transitions. [2019-09-08 05:39:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:39:36,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:36,565 INFO L399 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] [2019-09-08 05:39:36,566 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 127346286, now seen corresponding path program 1 times [2019-09-08 05:39:36,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:36,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:36,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:39:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:39:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:39:36,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:39:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:39:36,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:39:36,837 INFO L87 Difference]: Start difference. First operand 540 states and 755 transitions. Second operand 9 states. [2019-09-08 05:39:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:37,354 INFO L93 Difference]: Finished difference Result 1009 states and 1428 transitions. [2019-09-08 05:39:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:39:37,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-09-08 05:39:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:37,361 INFO L225 Difference]: With dead ends: 1009 [2019-09-08 05:39:37,362 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 05:39:37,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:39:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 05:39:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-09-08 05:39:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 05:39:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 754 transitions. [2019-09-08 05:39:37,398 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 754 transitions. Word has length 168 [2019-09-08 05:39:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:37,399 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 754 transitions. [2019-09-08 05:39:37,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:39:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 754 transitions. [2019-09-08 05:39:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:39:37,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:37,404 INFO L399 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] [2019-09-08 05:39:37,405 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1770150480, now seen corresponding path program 1 times [2019-09-08 05:39:37,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:37,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:37,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:39:37,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:39:37,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:39:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:39:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:39:37,899 INFO L87 Difference]: Start difference. First operand 540 states and 754 transitions. Second operand 18 states. [2019-09-08 05:39:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:43,039 INFO L93 Difference]: Finished difference Result 1408 states and 1986 transitions. [2019-09-08 05:39:43,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:39:43,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 168 [2019-09-08 05:39:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:43,048 INFO L225 Difference]: With dead ends: 1408 [2019-09-08 05:39:43,049 INFO L226 Difference]: Without dead ends: 1216 [2019-09-08 05:39:43,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 05:39:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-09-08 05:39:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1188. [2019-09-08 05:39:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-09-08 05:39:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1689 transitions. [2019-09-08 05:39:43,155 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1689 transitions. Word has length 168 [2019-09-08 05:39:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:43,158 INFO L475 AbstractCegarLoop]: Abstraction has 1188 states and 1689 transitions. [2019-09-08 05:39:43,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:39:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1689 transitions. [2019-09-08 05:39:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:39:43,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:43,163 INFO L399 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-09-08 05:39:43,164 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1725444874, now seen corresponding path program 1 times [2019-09-08 05:39:43,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:43,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:39:43,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:39:43,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:39:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:39:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:39:43,373 INFO L87 Difference]: Start difference. First operand 1188 states and 1689 transitions. Second operand 5 states. [2019-09-08 05:39:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:43,476 INFO L93 Difference]: Finished difference Result 1578 states and 2206 transitions. [2019-09-08 05:39:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:39:43,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 05:39:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:43,493 INFO L225 Difference]: With dead ends: 1578 [2019-09-08 05:39:43,493 INFO L226 Difference]: Without dead ends: 1185 [2019-09-08 05:39:43,495 INFO L628 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-09-08 05:39:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-08 05:39:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-09-08 05:39:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-09-08 05:39:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1684 transitions. [2019-09-08 05:39:43,578 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1684 transitions. Word has length 169 [2019-09-08 05:39:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:43,578 INFO L475 AbstractCegarLoop]: Abstraction has 1185 states and 1684 transitions. [2019-09-08 05:39:43,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1684 transitions. [2019-09-08 05:39:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:39:43,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:43,587 INFO L399 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-09-08 05:39:43,587 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash 796622306, now seen corresponding path program 1 times [2019-09-08 05:39:43,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:43,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:43,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:39:43,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:43,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:39:43,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:39:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:39:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:39:43,800 INFO L87 Difference]: Start difference. First operand 1185 states and 1684 transitions. Second operand 11 states. [2019-09-08 05:39:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:44,233 INFO L93 Difference]: Finished difference Result 1851 states and 2604 transitions. [2019-09-08 05:39:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:39:44,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-09-08 05:39:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:44,243 INFO L225 Difference]: With dead ends: 1851 [2019-09-08 05:39:44,243 INFO L226 Difference]: Without dead ends: 1265 [2019-09-08 05:39:44,246 INFO L628 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-09-08 05:39:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-09-08 05:39:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2019-09-08 05:39:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-09-08 05:39:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1810 transitions. [2019-09-08 05:39:44,381 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1810 transitions. Word has length 169 [2019-09-08 05:39:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:44,382 INFO L475 AbstractCegarLoop]: Abstraction has 1265 states and 1810 transitions. [2019-09-08 05:39:44,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:39:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1810 transitions. [2019-09-08 05:39:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:39:44,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:44,388 INFO L399 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-09-08 05:39:44,388 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -651976684, now seen corresponding path program 1 times [2019-09-08 05:39:44,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:44,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:44,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:44,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:39:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:39:44,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:39:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:39:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:39:44,575 INFO L87 Difference]: Start difference. First operand 1265 states and 1810 transitions. Second operand 5 states. [2019-09-08 05:39:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:45,797 INFO L93 Difference]: Finished difference Result 3031 states and 4309 transitions. [2019-09-08 05:39:45,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:39:45,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 05:39:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:45,819 INFO L225 Difference]: With dead ends: 3031 [2019-09-08 05:39:45,819 INFO L226 Difference]: Without dead ends: 2606 [2019-09-08 05:39:45,827 INFO L628 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-09-08 05:39:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-09-08 05:39:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2590. [2019-09-08 05:39:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-09-08 05:39:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3700 transitions. [2019-09-08 05:39:46,045 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3700 transitions. Word has length 169 [2019-09-08 05:39:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:46,047 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3700 transitions. [2019-09-08 05:39:46,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3700 transitions. [2019-09-08 05:39:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 05:39:46,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:46,057 INFO L399 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-09-08 05:39:46,058 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1632886771, now seen corresponding path program 1 times [2019-09-08 05:39:46,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:46,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:46,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:46,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:46,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:39:46,225 INFO L223 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) [2019-09-08 05:39:46,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:39:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:46,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:39:46,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:39:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:39:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:39:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 05:39:46,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:39:46,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:39:46,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:39:46,784 INFO L87 Difference]: Start difference. First operand 2590 states and 3700 transitions. Second operand 5 states. [2019-09-08 05:39:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:46,921 INFO L93 Difference]: Finished difference Result 4427 states and 6228 transitions. [2019-09-08 05:39:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:39:46,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-08 05:39:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:46,943 INFO L225 Difference]: With dead ends: 4427 [2019-09-08 05:39:46,944 INFO L226 Difference]: Without dead ends: 2660 [2019-09-08 05:39:46,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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-09-08 05:39:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-09-08 05:39:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2653. [2019-09-08 05:39:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-09-08 05:39:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3803 transitions. [2019-09-08 05:39:47,126 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3803 transitions. Word has length 169 [2019-09-08 05:39:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:47,126 INFO L475 AbstractCegarLoop]: Abstraction has 2653 states and 3803 transitions. [2019-09-08 05:39:47,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3803 transitions. [2019-09-08 05:39:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 05:39:47,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:47,140 INFO L399 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] [2019-09-08 05:39:47,140 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:47,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2080404502, now seen corresponding path program 1 times [2019-09-08 05:39:47,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:47,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:47,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:47,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:47,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:47,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:47,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:47,254 INFO L87 Difference]: Start difference. First operand 2653 states and 3803 transitions. Second operand 3 states. [2019-09-08 05:39:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:47,361 INFO L93 Difference]: Finished difference Result 5450 states and 7937 transitions. [2019-09-08 05:39:47,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:47,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 05:39:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:47,383 INFO L225 Difference]: With dead ends: 5450 [2019-09-08 05:39:47,384 INFO L226 Difference]: Without dead ends: 2901 [2019-09-08 05:39:47,397 INFO L628 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-09-08 05:39:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-09-08 05:39:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2898. [2019-09-08 05:39:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-09-08 05:39:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4245 transitions. [2019-09-08 05:39:47,575 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4245 transitions. Word has length 175 [2019-09-08 05:39:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:47,576 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4245 transitions. [2019-09-08 05:39:47,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4245 transitions. [2019-09-08 05:39:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:39:47,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:47,586 INFO L399 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] [2019-09-08 05:39:47,586 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash -424475495, now seen corresponding path program 2 times [2019-09-08 05:39:47,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:47,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:47,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:39:47,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:39:47,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:39:47,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:39:47,753 INFO L87 Difference]: Start difference. First operand 2898 states and 4245 transitions. Second operand 6 states. [2019-09-08 05:39:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:47,887 INFO L93 Difference]: Finished difference Result 5645 states and 8289 transitions. [2019-09-08 05:39:47,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:39:47,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 05:39:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:47,917 INFO L225 Difference]: With dead ends: 5645 [2019-09-08 05:39:47,917 INFO L226 Difference]: Without dead ends: 2901 [2019-09-08 05:39:47,931 INFO L628 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-09-08 05:39:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-09-08 05:39:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2898. [2019-09-08 05:39:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-09-08 05:39:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4239 transitions. [2019-09-08 05:39:48,170 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4239 transitions. Word has length 176 [2019-09-08 05:39:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:48,171 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4239 transitions. [2019-09-08 05:39:48,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:39:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4239 transitions. [2019-09-08 05:39:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:39:48,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:48,181 INFO L399 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] [2019-09-08 05:39:48,181 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -399517656, now seen corresponding path program 1 times [2019-09-08 05:39:48,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:48,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:39:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:48,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:48,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:48,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:48,304 INFO L87 Difference]: Start difference. First operand 2898 states and 4239 transitions. Second operand 3 states. [2019-09-08 05:39:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:48,420 INFO L93 Difference]: Finished difference Result 6147 states and 9188 transitions. [2019-09-08 05:39:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:48,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 05:39:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:48,451 INFO L225 Difference]: With dead ends: 6147 [2019-09-08 05:39:48,452 INFO L226 Difference]: Without dead ends: 3359 [2019-09-08 05:39:48,467 INFO L628 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-09-08 05:39:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2019-09-08 05:39:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3356. [2019-09-08 05:39:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2019-09-08 05:39:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 5062 transitions. [2019-09-08 05:39:48,713 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 5062 transitions. Word has length 176 [2019-09-08 05:39:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:48,714 INFO L475 AbstractCegarLoop]: Abstraction has 3356 states and 5062 transitions. [2019-09-08 05:39:48,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 5062 transitions. [2019-09-08 05:39:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 05:39:48,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:48,730 INFO L399 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] [2019-09-08 05:39:48,730 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1245093688, now seen corresponding path program 1 times [2019-09-08 05:39:48,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:48,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:48,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:48,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:48,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:48,905 INFO L87 Difference]: Start difference. First operand 3356 states and 5062 transitions. Second operand 3 states. [2019-09-08 05:39:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:49,055 INFO L93 Difference]: Finished difference Result 7479 states and 11564 transitions. [2019-09-08 05:39:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:49,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 05:39:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:49,093 INFO L225 Difference]: With dead ends: 7479 [2019-09-08 05:39:49,093 INFO L226 Difference]: Without dead ends: 4241 [2019-09-08 05:39:49,109 INFO L628 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-09-08 05:39:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2019-09-08 05:39:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 4238. [2019-09-08 05:39:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-09-08 05:39:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 6615 transitions. [2019-09-08 05:39:49,385 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 6615 transitions. Word has length 177 [2019-09-08 05:39:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:49,386 INFO L475 AbstractCegarLoop]: Abstraction has 4238 states and 6615 transitions. [2019-09-08 05:39:49,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 6615 transitions. [2019-09-08 05:39:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 05:39:49,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:49,405 INFO L399 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] [2019-09-08 05:39:49,405 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1498226824, now seen corresponding path program 1 times [2019-09-08 05:39:49,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:49,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:49,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:49,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:49,600 INFO L87 Difference]: Start difference. First operand 4238 states and 6615 transitions. Second operand 3 states. [2019-09-08 05:39:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:49,839 INFO L93 Difference]: Finished difference Result 10035 states and 16058 transitions. [2019-09-08 05:39:49,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:49,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 05:39:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:49,890 INFO L225 Difference]: With dead ends: 10035 [2019-09-08 05:39:49,891 INFO L226 Difference]: Without dead ends: 5927 [2019-09-08 05:39:49,915 INFO L628 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-09-08 05:39:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-09-08 05:39:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5924. [2019-09-08 05:39:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-09-08 05:39:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 9548 transitions. [2019-09-08 05:39:50,269 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 9548 transitions. Word has length 178 [2019-09-08 05:39:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:50,270 INFO L475 AbstractCegarLoop]: Abstraction has 5924 states and 9548 transitions. [2019-09-08 05:39:50,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 9548 transitions. [2019-09-08 05:39:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 05:39:50,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:50,300 INFO L399 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] [2019-09-08 05:39:50,300 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1989404968, now seen corresponding path program 1 times [2019-09-08 05:39:50,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:50,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:50,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:50,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:50,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:50,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:50,419 INFO L87 Difference]: Start difference. First operand 5924 states and 9548 transitions. Second operand 3 states. [2019-09-08 05:39:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:50,848 INFO L93 Difference]: Finished difference Result 15123 states and 24935 transitions. [2019-09-08 05:39:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:50,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 05:39:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:50,885 INFO L225 Difference]: With dead ends: 15123 [2019-09-08 05:39:50,886 INFO L226 Difference]: Without dead ends: 9337 [2019-09-08 05:39:50,911 INFO L628 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-09-08 05:39:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9337 states. [2019-09-08 05:39:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9337 to 9334. [2019-09-08 05:39:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9334 states. [2019-09-08 05:39:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9334 states to 9334 states and 15453 transitions. [2019-09-08 05:39:51,414 INFO L78 Accepts]: Start accepts. Automaton has 9334 states and 15453 transitions. Word has length 179 [2019-09-08 05:39:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:51,414 INFO L475 AbstractCegarLoop]: Abstraction has 9334 states and 15453 transitions. [2019-09-08 05:39:51,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9334 states and 15453 transitions. [2019-09-08 05:39:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:39:51,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:51,462 INFO L399 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] [2019-09-08 05:39:51,463 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 504785128, now seen corresponding path program 1 times [2019-09-08 05:39:51,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:51,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:51,583 INFO L87 Difference]: Start difference. First operand 9334 states and 15453 transitions. Second operand 3 states. [2019-09-08 05:39:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:52,790 INFO L93 Difference]: Finished difference Result 24865 states and 41873 transitions. [2019-09-08 05:39:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:52,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 05:39:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:52,864 INFO L225 Difference]: With dead ends: 24865 [2019-09-08 05:39:52,865 INFO L226 Difference]: Without dead ends: 15675 [2019-09-08 05:39:52,895 INFO L628 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-09-08 05:39:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15675 states. [2019-09-08 05:39:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15675 to 15672. [2019-09-08 05:39:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15672 states. [2019-09-08 05:39:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15672 states to 15672 states and 26398 transitions. [2019-09-08 05:39:53,832 INFO L78 Accepts]: Start accepts. Automaton has 15672 states and 26398 transitions. Word has length 180 [2019-09-08 05:39:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:53,833 INFO L475 AbstractCegarLoop]: Abstraction has 15672 states and 26398 transitions. [2019-09-08 05:39:53,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15672 states and 26398 transitions. [2019-09-08 05:39:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 05:39:53,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:53,932 INFO L399 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] [2019-09-08 05:39:53,932 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1215101332, now seen corresponding path program 1 times [2019-09-08 05:39:53,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:53,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:53,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:39:54,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:39:54,066 INFO L223 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) [2019-09-08 05:39:54,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:39:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:54,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 2594 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:39:54,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:39:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:39:54,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:39:54,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:39:54,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:39:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:39:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:39:54,675 INFO L87 Difference]: Start difference. First operand 15672 states and 26398 transitions. Second operand 6 states. [2019-09-08 05:39:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:55,300 INFO L93 Difference]: Finished difference Result 18329 states and 30238 transitions. [2019-09-08 05:39:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:39:55,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-08 05:39:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:55,392 INFO L225 Difference]: With dead ends: 18329 [2019-09-08 05:39:55,393 INFO L226 Difference]: Without dead ends: 16562 [2019-09-08 05:39:55,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 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-09-08 05:39:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16562 states. [2019-09-08 05:39:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16562 to 16483. [2019-09-08 05:39:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16483 states. [2019-09-08 05:39:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16483 states to 16483 states and 27672 transitions. [2019-09-08 05:39:56,885 INFO L78 Accepts]: Start accepts. Automaton has 16483 states and 27672 transitions. Word has length 187 [2019-09-08 05:39:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:56,886 INFO L475 AbstractCegarLoop]: Abstraction has 16483 states and 27672 transitions. [2019-09-08 05:39:56,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:39:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16483 states and 27672 transitions. [2019-09-08 05:39:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 05:39:56,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:56,966 INFO L399 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] [2019-09-08 05:39:56,966 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -177487174, now seen corresponding path program 1 times [2019-09-08 05:39:56,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:56,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:39:57,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:57,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:57,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:57,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:57,102 INFO L87 Difference]: Start difference. First operand 16483 states and 27672 transitions. Second operand 3 states. [2019-09-08 05:39:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:58,720 INFO L93 Difference]: Finished difference Result 44529 states and 75706 transitions. [2019-09-08 05:39:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:58,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 05:39:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:58,833 INFO L225 Difference]: With dead ends: 44529 [2019-09-08 05:39:58,833 INFO L226 Difference]: Without dead ends: 28664 [2019-09-08 05:39:58,881 INFO L628 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-09-08 05:39:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28664 states. [2019-09-08 05:40:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28664 to 28661. [2019-09-08 05:40:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28661 states. [2019-09-08 05:40:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28661 states to 28661 states and 48505 transitions. [2019-09-08 05:40:00,533 INFO L78 Accepts]: Start accepts. Automaton has 28661 states and 48505 transitions. Word has length 181 [2019-09-08 05:40:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:00,534 INFO L475 AbstractCegarLoop]: Abstraction has 28661 states and 48505 transitions. [2019-09-08 05:40:00,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28661 states and 48505 transitions. [2019-09-08 05:40:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:40:00,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:00,600 INFO L399 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] [2019-09-08 05:40:00,600 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -50841208, now seen corresponding path program 1 times [2019-09-08 05:40:00,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:00,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:40:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:00,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:00,717 INFO L87 Difference]: Start difference. First operand 28661 states and 48505 transitions. Second operand 3 states. [2019-09-08 05:40:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:02,245 INFO L93 Difference]: Finished difference Result 79789 states and 135352 transitions. [2019-09-08 05:40:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:02,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-08 05:40:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:02,415 INFO L225 Difference]: With dead ends: 79789 [2019-09-08 05:40:02,415 INFO L226 Difference]: Without dead ends: 51878 [2019-09-08 05:40:02,501 INFO L628 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-09-08 05:40:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51878 states. [2019-09-08 05:40:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51878 to 51875. [2019-09-08 05:40:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51875 states. [2019-09-08 05:40:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51875 states to 51875 states and 87136 transitions. [2019-09-08 05:40:06,092 INFO L78 Accepts]: Start accepts. Automaton has 51875 states and 87136 transitions. Word has length 182 [2019-09-08 05:40:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:06,092 INFO L475 AbstractCegarLoop]: Abstraction has 51875 states and 87136 transitions. [2019-09-08 05:40:06,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 51875 states and 87136 transitions. [2019-09-08 05:40:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:40:06,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:06,174 INFO L399 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] [2019-09-08 05:40:06,174 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 543668762, now seen corresponding path program 1 times [2019-09-08 05:40:06,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:06,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:06,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:06,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:40:06,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:06,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:06,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:06,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:06,281 INFO L87 Difference]: Start difference. First operand 51875 states and 87136 transitions. Second operand 3 states. [2019-09-08 05:40:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:10,888 INFO L93 Difference]: Finished difference Result 146653 states and 247504 transitions. [2019-09-08 05:40:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:10,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 05:40:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:11,226 INFO L225 Difference]: With dead ends: 146653 [2019-09-08 05:40:11,226 INFO L226 Difference]: Without dead ends: 95744 [2019-09-08 05:40:11,385 INFO L628 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-09-08 05:40:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95744 states. [2019-09-08 05:40:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95744 to 95741. [2019-09-08 05:40:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95741 states. [2019-09-08 05:40:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95741 states to 95741 states and 160195 transitions. [2019-09-08 05:40:17,417 INFO L78 Accepts]: Start accepts. Automaton has 95741 states and 160195 transitions. Word has length 183 [2019-09-08 05:40:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 95741 states and 160195 transitions. [2019-09-08 05:40:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 95741 states and 160195 transitions. [2019-09-08 05:40:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 05:40:17,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:17,501 INFO L399 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] [2019-09-08 05:40:17,501 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:17,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1500448216, now seen corresponding path program 1 times [2019-09-08 05:40:17,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:17,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:40:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:17,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:17,612 INFO L87 Difference]: Start difference. First operand 95741 states and 160195 transitions. Second operand 3 states. [2019-09-08 05:40:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:25,269 INFO L93 Difference]: Finished difference Result 180611 states and 299536 transitions. [2019-09-08 05:40:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 05:40:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:25,836 INFO L225 Difference]: With dead ends: 180611 [2019-09-08 05:40:25,836 INFO L226 Difference]: Without dead ends: 178844 [2019-09-08 05:40:25,906 INFO L628 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-09-08 05:40:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178844 states. [2019-09-08 05:40:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178844 to 178841. [2019-09-08 05:40:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178841 states. [2019-09-08 05:40:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178841 states to 178841 states and 294027 transitions. [2019-09-08 05:40:33,241 INFO L78 Accepts]: Start accepts. Automaton has 178841 states and 294027 transitions. Word has length 184 [2019-09-08 05:40:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:33,241 INFO L475 AbstractCegarLoop]: Abstraction has 178841 states and 294027 transitions. [2019-09-08 05:40:33,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 178841 states and 294027 transitions. [2019-09-08 05:40:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 05:40:33,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:33,343 INFO L399 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] [2019-09-08 05:40:33,343 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1796750982, now seen corresponding path program 1 times [2019-09-08 05:40:33,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:33,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:40:36,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:36,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:36,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:36,987 INFO L87 Difference]: Start difference. First operand 178841 states and 294027 transitions. Second operand 3 states. [2019-09-08 05:40:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:41,750 INFO L93 Difference]: Finished difference Result 181189 states and 297261 transitions. [2019-09-08 05:40:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:41,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-09-08 05:40:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:42,634 INFO L225 Difference]: With dead ends: 181189 [2019-09-08 05:40:42,635 INFO L226 Difference]: Without dead ends: 179456 [2019-09-08 05:40:42,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179456 states. [2019-09-08 05:40:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179456 to 179444. [2019-09-08 05:40:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179444 states. [2019-09-08 05:40:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179444 states to 179444 states and 294834 transitions. [2019-09-08 05:40:55,250 INFO L78 Accepts]: Start accepts. Automaton has 179444 states and 294834 transitions. Word has length 185 [2019-09-08 05:40:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:55,250 INFO L475 AbstractCegarLoop]: Abstraction has 179444 states and 294834 transitions. [2019-09-08 05:40:55,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 179444 states and 294834 transitions. [2019-09-08 05:40:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 05:40:55,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:55,996 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:40:55,997 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1259616181, now seen corresponding path program 1 times [2019-09-08 05:40:55,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:40:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:56,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:40:56,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:40:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:40:56,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:40:56,654 INFO L87 Difference]: Start difference. First operand 179444 states and 294834 transitions. Second operand 6 states. [2019-09-08 05:41:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:12,678 INFO L93 Difference]: Finished difference Result 352447 states and 582155 transitions. [2019-09-08 05:41:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:41:12,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 299 [2019-09-08 05:41:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:14,104 INFO L225 Difference]: With dead ends: 352447 [2019-09-08 05:41:14,104 INFO L226 Difference]: Without dead ends: 350153 [2019-09-08 05:41:14,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350153 states. [2019-09-08 05:41:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350153 to 350106. [2019-09-08 05:41:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350106 states. [2019-09-08 05:41:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350106 states to 350106 states and 578977 transitions. [2019-09-08 05:41:37,355 INFO L78 Accepts]: Start accepts. Automaton has 350106 states and 578977 transitions. Word has length 299 [2019-09-08 05:41:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:37,356 INFO L475 AbstractCegarLoop]: Abstraction has 350106 states and 578977 transitions. [2019-09-08 05:41:37,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:41:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 350106 states and 578977 transitions. [2019-09-08 05:41:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:41:38,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:38,812 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:41:38,812 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1670405569, now seen corresponding path program 1 times [2019-09-08 05:41:38,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:38,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:38,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:41:39,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:39,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:41:39,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:41:39,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:41:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:39,011 INFO L87 Difference]: Start difference. First operand 350106 states and 578977 transitions. Second operand 9 states. [2019-09-08 05:41:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:54,623 INFO L93 Difference]: Finished difference Result 354318 states and 584639 transitions. [2019-09-08 05:41:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:41:54,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-08 05:41:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:55,705 INFO L225 Difference]: With dead ends: 354318 [2019-09-08 05:41:55,705 INFO L226 Difference]: Without dead ends: 349644 [2019-09-08 05:41:55,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:41:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349644 states. [2019-09-08 05:42:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349644 to 349604. [2019-09-08 05:42:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349604 states. [2019-09-08 05:42:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349604 states to 349604 states and 578235 transitions. [2019-09-08 05:42:29,503 INFO L78 Accepts]: Start accepts. Automaton has 349604 states and 578235 transitions. Word has length 300 [2019-09-08 05:42:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:29,503 INFO L475 AbstractCegarLoop]: Abstraction has 349604 states and 578235 transitions. [2019-09-08 05:42:29,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:42:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 349604 states and 578235 transitions. [2019-09-08 05:42:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 05:42:30,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:30,867 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:42:30,867 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 893813167, now seen corresponding path program 1 times [2019-09-08 05:42:30,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:30,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:30,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:30,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:31,747 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2019-09-08 05:42:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 05:42:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:31,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:42:31,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:42:31,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:42:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:42:31,813 INFO L87 Difference]: Start difference. First operand 349604 states and 578235 transitions. Second operand 10 states. [2019-09-08 05:42:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:50,892 INFO L93 Difference]: Finished difference Result 351266 states and 580379 transitions. [2019-09-08 05:42:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:42:50,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 293 [2019-09-08 05:42:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:52,400 INFO L225 Difference]: With dead ends: 351266 [2019-09-08 05:42:52,400 INFO L226 Difference]: Without dead ends: 347072 [2019-09-08 05:42:52,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:42:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347072 states. [2019-09-08 05:43:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347072 to 343082. [2019-09-08 05:43:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343082 states. [2019-09-08 05:43:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343082 states to 343082 states and 558129 transitions. [2019-09-08 05:43:22,733 INFO L78 Accepts]: Start accepts. Automaton has 343082 states and 558129 transitions. Word has length 293 [2019-09-08 05:43:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:22,733 INFO L475 AbstractCegarLoop]: Abstraction has 343082 states and 558129 transitions. [2019-09-08 05:43:22,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:43:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 343082 states and 558129 transitions. [2019-09-08 05:43:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 05:43:24,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:24,121 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:43:24,121 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 950075038, now seen corresponding path program 1 times [2019-09-08 05:43:24,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:24,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:43:24,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:24,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:43:24,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:43:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:43:24,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:43:24,304 INFO L87 Difference]: Start difference. First operand 343082 states and 558129 transitions. Second operand 7 states. [2019-09-08 05:43:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:45,227 INFO L93 Difference]: Finished difference Result 678170 states and 1113272 transitions. [2019-09-08 05:43:45,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:43:45,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-09-08 05:43:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:46,583 INFO L225 Difference]: With dead ends: 678170 [2019-09-08 05:43:46,583 INFO L226 Difference]: Without dead ends: 343136 [2019-09-08 05:43:47,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:43:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343136 states. [2019-09-08 05:44:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343136 to 343136. [2019-09-08 05:44:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343136 states. [2019-09-08 05:44:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343136 states to 343136 states and 558195 transitions. [2019-09-08 05:44:16,570 INFO L78 Accepts]: Start accepts. Automaton has 343136 states and 558195 transitions. Word has length 343 [2019-09-08 05:44:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:16,571 INFO L475 AbstractCegarLoop]: Abstraction has 343136 states and 558195 transitions. [2019-09-08 05:44:16,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:44:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 343136 states and 558195 transitions. [2019-09-08 05:44:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 05:44:18,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:18,208 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:18,208 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1566235788, now seen corresponding path program 1 times [2019-09-08 05:44:18,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:18,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:18,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 05:44:18,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:44:18,463 INFO L223 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) [2019-09-08 05:44:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:44:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:18,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 3415 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:44:18,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:44:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:44:19,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:44:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-08 05:44:19,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:44:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:44:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:44:19,070 INFO L87 Difference]: Start difference. First operand 343136 states and 558195 transitions. Second operand 11 states. [2019-09-08 05:44:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:36,778 INFO L93 Difference]: Finished difference Result 355310 states and 576209 transitions. [2019-09-08 05:44:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:44:36,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 344 [2019-09-08 05:44:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:37,901 INFO L225 Difference]: With dead ends: 355310 [2019-09-08 05:44:37,901 INFO L226 Difference]: Without dead ends: 353571 [2019-09-08 05:44:38,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:44:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353571 states. [2019-09-08 05:45:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353571 to 348791. [2019-09-08 05:45:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348791 states. [2019-09-08 05:45:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348791 states to 348791 states and 566645 transitions. [2019-09-08 05:45:06,404 INFO L78 Accepts]: Start accepts. Automaton has 348791 states and 566645 transitions. Word has length 344 [2019-09-08 05:45:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:06,404 INFO L475 AbstractCegarLoop]: Abstraction has 348791 states and 566645 transitions. [2019-09-08 05:45:06,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:45:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 348791 states and 566645 transitions. [2019-09-08 05:45:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 05:45:08,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:08,860 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:45:08,860 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -376865820, now seen corresponding path program 1 times [2019-09-08 05:45:08,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:08,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-08 05:45:09,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:45:09,094 INFO L223 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-09-08 05:45:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:09,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 3448 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-08 05:45:09,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:45:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 77 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 05:45:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:45:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 26 [2019-09-08 05:45:10,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:45:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:45:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:45:10,192 INFO L87 Difference]: Start difference. First operand 348791 states and 566645 transitions. Second operand 26 states. [2019-09-08 05:46:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:11,466 INFO L93 Difference]: Finished difference Result 584874 states and 963521 transitions. [2019-09-08 05:46:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-08 05:46:11,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 357 [2019-09-08 05:46:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:13,577 INFO L225 Difference]: With dead ends: 584874 [2019-09-08 05:46:13,578 INFO L226 Difference]: Without dead ends: 580534 [2019-09-08 05:46:13,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10093 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2934, Invalid=22826, Unknown=0, NotChecked=0, Total=25760 [2019-09-08 05:46:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580534 states. [2019-09-08 05:47:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580534 to 580055. [2019-09-08 05:47:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580055 states. [2019-09-08 05:47:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580055 states to 580055 states and 957298 transitions. [2019-09-08 05:47:07,582 INFO L78 Accepts]: Start accepts. Automaton has 580055 states and 957298 transitions. Word has length 357 [2019-09-08 05:47:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:07,583 INFO L475 AbstractCegarLoop]: Abstraction has 580055 states and 957298 transitions. [2019-09-08 05:47:07,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:47:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 580055 states and 957298 transitions. [2019-09-08 05:47:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 05:47:10,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:10,503 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:47:10,503 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:10,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:10,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2093942565, now seen corresponding path program 1 times [2019-09-08 05:47:10,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:10,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:10,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:47:12,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:12,056 INFO L223 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) [2019-09-08 05:47:12,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:47:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:12,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 3447 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 05:47:12,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 05:47:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [9] total 27 [2019-09-08 05:47:12,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 05:47:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 05:47:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:47:12,972 INFO L87 Difference]: Start difference. First operand 580055 states and 957298 transitions. Second operand 27 states. [2019-09-08 05:47:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:47:46,382 INFO L93 Difference]: Finished difference Result 587506 states and 966843 transitions. [2019-09-08 05:47:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:47:46,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 358 [2019-09-08 05:47:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:47:48,417 INFO L225 Difference]: With dead ends: 587506 [2019-09-08 05:47:48,418 INFO L226 Difference]: Without dead ends: 577133 [2019-09-08 05:47:48,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 05:47:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577133 states. [2019-09-08 05:48:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577133 to 576595. [2019-09-08 05:48:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576595 states. [2019-09-08 05:48:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576595 states to 576595 states and 952678 transitions. [2019-09-08 05:48:44,515 INFO L78 Accepts]: Start accepts. Automaton has 576595 states and 952678 transitions. Word has length 358 [2019-09-08 05:48:44,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:48:44,515 INFO L475 AbstractCegarLoop]: Abstraction has 576595 states and 952678 transitions. [2019-09-08 05:48:44,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 05:48:44,515 INFO L276 IsEmpty]: Start isEmpty. Operand 576595 states and 952678 transitions. [2019-09-08 05:48:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-08 05:48:47,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:48:47,080 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:48:47,080 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:48:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:48:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash -397515888, now seen corresponding path program 1 times [2019-09-08 05:48:47,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:48:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:48:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:48:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:48:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:48:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-08 05:48:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:48:48,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:48:48,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:48:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:48:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:48:48,091 INFO L87 Difference]: Start difference. First operand 576595 states and 952678 transitions. Second operand 6 states. [2019-09-08 05:49:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:27,298 INFO L93 Difference]: Finished difference Result 1142090 states and 1910269 transitions. [2019-09-08 05:49:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:49:27,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 367 [2019-09-08 05:49:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:29,322 INFO L225 Difference]: With dead ends: 1142090 [2019-09-08 05:49:29,323 INFO L226 Difference]: Without dead ends: 576475 [2019-09-08 05:49:31,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:49:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576475 states.