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_spec4_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:19:56,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:19:56,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:19:56,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:19:56,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:19:56,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:19:56,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:19:56,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:19:56,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:19:56,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:19:56,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:19:56,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:19:56,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:19:56,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:19:56,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:19:56,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:19:56,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:19:56,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:19:56,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:19:56,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:19:56,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:19:56,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:19:56,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:19:56,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:19:56,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:19:56,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:19:56,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:19:56,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:19:56,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:19:56,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:19:56,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:19:56,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:19:56,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:19:56,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:19:56,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:19:56,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:19:56,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:19:56,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:19:56,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:19:56,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:19:56,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:19:56,917 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:19:56,938 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:19:56,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:19:56,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:19:56,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:19:56,943 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:19:56,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:19:56,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:19:56,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:19:56,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:19:56,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:19:56,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:19:56,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:19:56,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:19:56,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:19:56,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:19:56,947 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:19:56,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:19:56,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:19:56,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:19:56,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:19:56,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:19:56,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:19:56,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:19:56,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:19:56,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:19:56,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:19:56,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:19:56,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:19:56,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:19:57,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:19:57,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:19:57,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:19:57,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:19:57,028 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:19:57,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_productSimulator.cil.c [2019-09-08 05:19:57,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac24bf47/b73eb1558677493793cd19ce1b11ea8e/FLAG981305b04 [2019-09-08 05:19:57,805 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:19:57,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_productSimulator.cil.c [2019-09-08 05:19:57,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac24bf47/b73eb1558677493793cd19ce1b11ea8e/FLAG981305b04 [2019-09-08 05:19:58,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac24bf47/b73eb1558677493793cd19ce1b11ea8e [2019-09-08 05:19:58,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:19:58,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:19:58,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:19:58,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:19:58,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:19:58,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:19:58" (1/1) ... [2019-09-08 05:19:58,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@780b3015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:58, skipping insertion in model container [2019-09-08 05:19:58,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:19:58" (1/1) ... [2019-09-08 05:19:58,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:19:58,482 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:19:59,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:19:59,476 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:19:59,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:19:59,855 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:19:59,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59 WrapperNode [2019-09-08 05:19:59,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:19:59,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:19:59,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:19:59,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:19:59,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:19:59,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:19:59,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:19:59,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:20:00,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:20:00,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:20:00,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (1/1) ... [2019-09-08 05:20:00,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:20:00,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:20:00,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:20:00,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:20:00,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (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:20:00,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:20:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:20:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:20:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-09-08 05:20:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-09-08 05:20:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-09-08 05:20:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-09-08 05:20:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-09-08 05:20:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-09-08 05:20:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:20:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:20:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-09-08 05:20:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-09-08 05:20:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-09-08 05:20:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-09-08 05:20:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-09-08 05:20:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-09-08 05:20:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-09-08 05:20:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-09-08 05:20:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:20:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:20:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:20:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:20:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:20:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:20:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:20:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:20:00,251 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:20:00,252 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:20:00,252 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:20:00,252 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:20:00,252 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:20:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:20:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:20:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:20:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:20:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:20:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:20:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:20:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:20:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:20:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:20:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:20:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:20:00,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:20:00,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:20:00,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:20:00,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:20:00,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:20:00,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:20:00,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:20:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:20:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:20:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:20:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:20:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:20:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:20:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:20:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:20:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:20:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:20:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:20:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:20:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:20:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:20:00,261 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:20:00,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:20:00,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:20:00,262 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:20:00,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:20:00,262 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:20:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:20:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:20:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:20:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:20:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:20:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:20:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:20:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-09-08 05:20:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-09-08 05:20:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:20:00,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-09-08 05:20:00,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-09-08 05:20:00,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:20:00,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-09-08 05:20:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-09-08 05:20:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:20:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:20:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:20:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:20:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:20:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:20:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:20:00,268 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:20:00,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:20:00,268 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:20:00,268 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:20:00,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:20:00,269 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:20:00,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:20:00,269 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:20:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:20:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:20:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-09-08 05:20:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-09-08 05:20:00,270 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-09-08 05:20:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-09-08 05:20:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-09-08 05:20:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-09-08 05:20:00,271 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:20:00,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:20:00,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:20:00,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:20:00,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:20:00,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:20:00,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:20:00,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:20:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:20:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:20:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:20:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:20:00,305 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:20:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:20:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:20:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:20:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:20:00,306 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:20:00,307 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:20:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:20:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:20:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:20:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-09-08 05:20:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-09-08 05:20:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-09-08 05:20:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-09-08 05:20:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-09-08 05:20:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-09-08 05:20:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-09-08 05:20:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-09-08 05:20:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-09-08 05:20:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-09-08 05:20:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-09-08 05:20:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-09-08 05:20:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-09-08 05:20:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-09-08 05:20:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-09-08 05:20:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:20:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:20:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:20:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:20:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:20:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:20:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:20:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:20:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:20:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:20:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:20:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:20:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:20:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:20:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:20:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:20:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-09-08 05:20:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:20:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-09-08 05:20:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-09-08 05:20:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-09-08 05:20:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-09-08 05:20:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-09-08 05:20:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-09-08 05:20:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-09-08 05:20:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-09-08 05:20:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:20:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:20:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:20:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:20:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:20:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:20:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:20:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:20:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:20:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:20:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:20:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:20:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:20:02,821 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:20:02,822 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:20:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:20:02 BoogieIcfgContainer [2019-09-08 05:20:02,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:20:02,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:20:02,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:20:02,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:20:02,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:19:58" (1/3) ... [2019-09-08 05:20:02,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792128c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:20:02, skipping insertion in model container [2019-09-08 05:20:02,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:19:59" (2/3) ... [2019-09-08 05:20:02,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792128c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:20:02, skipping insertion in model container [2019-09-08 05:20:02,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:20:02" (3/3) ... [2019-09-08 05:20:02,832 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_productSimulator.cil.c [2019-09-08 05:20:02,843 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:20:02,856 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:20:02,874 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:20:02,921 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:20:02,921 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:20:02,921 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:20:02,922 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:20:02,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:20:02,922 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:20:02,922 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:20:02,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:20:02,922 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:20:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states. [2019-09-08 05:20:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 05:20:03,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:03,011 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:03,016 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:03,023 INFO L82 PathProgramCache]: Analyzing trace with hash 894970913, now seen corresponding path program 1 times [2019-09-08 05:20:03,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:20:03,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:03,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:20:03,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:20:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:20:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:20:03,886 INFO L87 Difference]: Start difference. First operand 814 states. Second operand 6 states. [2019-09-08 05:20:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:04,159 INFO L93 Difference]: Finished difference Result 1546 states and 2137 transitions. [2019-09-08 05:20:04,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:20:04,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 05:20:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:04,200 INFO L225 Difference]: With dead ends: 1546 [2019-09-08 05:20:04,201 INFO L226 Difference]: Without dead ends: 785 [2019-09-08 05:20:04,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:20:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-09-08 05:20:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2019-09-08 05:20:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-08 05:20:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1069 transitions. [2019-09-08 05:20:04,367 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1069 transitions. Word has length 176 [2019-09-08 05:20:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:04,375 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1069 transitions. [2019-09-08 05:20:04,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:20:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1069 transitions. [2019-09-08 05:20:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:20:04,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:04,385 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:04,385 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:04,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash 844588009, now seen corresponding path program 1 times [2019-09-08 05:20:04,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:04,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:20:04,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:04,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:20:04,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:20:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:20:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:04,696 INFO L87 Difference]: Start difference. First operand 785 states and 1069 transitions. Second operand 4 states. [2019-09-08 05:20:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:05,488 INFO L93 Difference]: Finished difference Result 1529 states and 2109 transitions. [2019-09-08 05:20:05,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:20:05,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-08 05:20:05,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:05,495 INFO L225 Difference]: With dead ends: 1529 [2019-09-08 05:20:05,495 INFO L226 Difference]: Without dead ends: 786 [2019-09-08 05:20:05,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-08 05:20:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2019-09-08 05:20:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-08 05:20:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1063 transitions. [2019-09-08 05:20:05,534 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1063 transitions. Word has length 182 [2019-09-08 05:20:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:05,535 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1063 transitions. [2019-09-08 05:20:05,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:20:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1063 transitions. [2019-09-08 05:20:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 05:20:05,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:05,540 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:05,540 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1828917881, now seen corresponding path program 1 times [2019-09-08 05:20:05,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:20:05,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:05,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:05,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:05,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:05,776 INFO L87 Difference]: Start difference. First operand 786 states and 1063 transitions. Second operand 3 states. [2019-09-08 05:20:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:05,932 INFO L93 Difference]: Finished difference Result 1523 states and 2087 transitions. [2019-09-08 05:20:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:05,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 05:20:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:05,938 INFO L225 Difference]: With dead ends: 1523 [2019-09-08 05:20:05,939 INFO L226 Difference]: Without dead ends: 784 [2019-09-08 05:20:05,942 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:20:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-09-08 05:20:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-09-08 05:20:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-09-08 05:20:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1056 transitions. [2019-09-08 05:20:05,977 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1056 transitions. Word has length 197 [2019-09-08 05:20:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:05,977 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1056 transitions. [2019-09-08 05:20:05,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1056 transitions. [2019-09-08 05:20:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:20:05,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:05,982 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:05,982 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1474081530, now seen corresponding path program 1 times [2019-09-08 05:20:05,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:05,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:20:06,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:06,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:20:06,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:20:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:20:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:06,142 INFO L87 Difference]: Start difference. First operand 784 states and 1056 transitions. Second operand 4 states. [2019-09-08 05:20:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:06,988 INFO L93 Difference]: Finished difference Result 1508 states and 2038 transitions. [2019-09-08 05:20:06,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:20:06,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-09-08 05:20:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:06,995 INFO L225 Difference]: With dead ends: 1508 [2019-09-08 05:20:06,995 INFO L226 Difference]: Without dead ends: 790 [2019-09-08 05:20:06,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-08 05:20:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 784. [2019-09-08 05:20:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-09-08 05:20:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1041 transitions. [2019-09-08 05:20:07,041 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1041 transitions. Word has length 198 [2019-09-08 05:20:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:07,042 INFO L475 AbstractCegarLoop]: Abstraction has 784 states and 1041 transitions. [2019-09-08 05:20:07,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:20:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1041 transitions. [2019-09-08 05:20:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 05:20:07,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:07,047 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:20:07,047 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash -193734372, now seen corresponding path program 1 times [2019-09-08 05:20:07,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:07,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:07,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:07,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:20:07,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:07,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:07,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:07,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:07,241 INFO L87 Difference]: Start difference. First operand 784 states and 1041 transitions. Second operand 3 states. [2019-09-08 05:20:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:07,298 INFO L93 Difference]: Finished difference Result 1218 states and 1599 transitions. [2019-09-08 05:20:07,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:07,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 05:20:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:07,306 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 05:20:07,306 INFO L226 Difference]: Without dead ends: 787 [2019-09-08 05:20:07,311 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:20:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-09-08 05:20:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 786. [2019-09-08 05:20:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-08 05:20:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1043 transitions. [2019-09-08 05:20:07,355 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1043 transitions. Word has length 225 [2019-09-08 05:20:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:07,355 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1043 transitions. [2019-09-08 05:20:07,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1043 transitions. [2019-09-08 05:20:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 05:20:07,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:07,360 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,360 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:07,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1198995616, now seen corresponding path program 1 times [2019-09-08 05:20:07,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:07,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:07,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:07,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:20:07,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:07,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:07,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:07,538 INFO L87 Difference]: Start difference. First operand 786 states and 1043 transitions. Second operand 3 states. [2019-09-08 05:20:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:07,603 INFO L93 Difference]: Finished difference Result 1507 states and 2040 transitions. [2019-09-08 05:20:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:07,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 05:20:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:07,615 INFO L225 Difference]: With dead ends: 1507 [2019-09-08 05:20:07,615 INFO L226 Difference]: Without dead ends: 841 [2019-09-08 05:20:07,618 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:20:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-08 05:20:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 840. [2019-09-08 05:20:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-08 05:20:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1131 transitions. [2019-09-08 05:20:07,662 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1131 transitions. Word has length 233 [2019-09-08 05:20:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:07,668 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1131 transitions. [2019-09-08 05:20:07,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1131 transitions. [2019-09-08 05:20:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 05:20:07,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:07,675 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,675 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash -814096783, now seen corresponding path program 1 times [2019-09-08 05:20:07,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:07,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:07,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:07,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:07,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:20:07,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:20:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:20:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:20:07,980 INFO L87 Difference]: Start difference. First operand 840 states and 1131 transitions. Second operand 7 states. [2019-09-08 05:20:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:12,628 INFO L93 Difference]: Finished difference Result 1696 states and 2250 transitions. [2019-09-08 05:20:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:20:12,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 234 [2019-09-08 05:20:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:12,651 INFO L225 Difference]: With dead ends: 1696 [2019-09-08 05:20:12,651 INFO L226 Difference]: Without dead ends: 1274 [2019-09-08 05:20:12,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:20:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-08 05:20:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1265. [2019-09-08 05:20:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-09-08 05:20:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1683 transitions. [2019-09-08 05:20:12,772 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1683 transitions. Word has length 234 [2019-09-08 05:20:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:12,777 INFO L475 AbstractCegarLoop]: Abstraction has 1265 states and 1683 transitions. [2019-09-08 05:20:12,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:20:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1683 transitions. [2019-09-08 05:20:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 05:20:12,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:12,787 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:12,787 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1823344465, now seen corresponding path program 1 times [2019-09-08 05:20:12,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:12,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:12,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:12,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:13,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:20:13,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:20:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:20:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:20:13,332 INFO L87 Difference]: Start difference. First operand 1265 states and 1683 transitions. Second operand 22 states. [2019-09-08 05:20:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:13,950 INFO L93 Difference]: Finished difference Result 2197 states and 2903 transitions. [2019-09-08 05:20:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:20:13,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 235 [2019-09-08 05:20:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:13,967 INFO L225 Difference]: With dead ends: 2197 [2019-09-08 05:20:13,967 INFO L226 Difference]: Without dead ends: 1342 [2019-09-08 05:20:13,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:20:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-09-08 05:20:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1340. [2019-09-08 05:20:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2019-09-08 05:20:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1781 transitions. [2019-09-08 05:20:14,080 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1781 transitions. Word has length 235 [2019-09-08 05:20:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:14,081 INFO L475 AbstractCegarLoop]: Abstraction has 1340 states and 1781 transitions. [2019-09-08 05:20:14,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:20:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1781 transitions. [2019-09-08 05:20:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:20:14,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:14,088 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:14,088 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1517774566, now seen corresponding path program 1 times [2019-09-08 05:20:14,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:14,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:14,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:14,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:14,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:20:14,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:20:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:20:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:20:14,524 INFO L87 Difference]: Start difference. First operand 1340 states and 1781 transitions. Second operand 24 states. [2019-09-08 05:20:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:15,343 INFO L93 Difference]: Finished difference Result 2282 states and 3023 transitions. [2019-09-08 05:20:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:20:15,343 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 244 [2019-09-08 05:20:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:15,352 INFO L225 Difference]: With dead ends: 2282 [2019-09-08 05:20:15,353 INFO L226 Difference]: Without dead ends: 1432 [2019-09-08 05:20:15,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:20:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-09-08 05:20:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1431. [2019-09-08 05:20:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-09-08 05:20:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1905 transitions. [2019-09-08 05:20:15,429 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1905 transitions. Word has length 244 [2019-09-08 05:20:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:15,430 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 1905 transitions. [2019-09-08 05:20:15,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:20:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1905 transitions. [2019-09-08 05:20:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 05:20:15,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:15,437 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,437 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1200779726, now seen corresponding path program 1 times [2019-09-08 05:20:15,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:20:15,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:20:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:20:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:20:15,689 INFO L87 Difference]: Start difference. First operand 1431 states and 1905 transitions. Second operand 8 states. [2019-09-08 05:20:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:17,207 INFO L93 Difference]: Finished difference Result 3235 states and 4277 transitions. [2019-09-08 05:20:17,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:20:17,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 244 [2019-09-08 05:20:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:17,225 INFO L225 Difference]: With dead ends: 3235 [2019-09-08 05:20:17,226 INFO L226 Difference]: Without dead ends: 2490 [2019-09-08 05:20:17,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:20:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2019-09-08 05:20:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2467. [2019-09-08 05:20:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-09-08 05:20:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3272 transitions. [2019-09-08 05:20:17,365 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3272 transitions. Word has length 244 [2019-09-08 05:20:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:17,366 INFO L475 AbstractCegarLoop]: Abstraction has 2467 states and 3272 transitions. [2019-09-08 05:20:17,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:20:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3272 transitions. [2019-09-08 05:20:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:20:17,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:17,378 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,378 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -44557591, now seen corresponding path program 1 times [2019-09-08 05:20:17,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:17,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:17,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:20:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:20:17,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:20:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:20:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:20:17,896 INFO L87 Difference]: Start difference. First operand 2467 states and 3272 transitions. Second operand 21 states. [2019-09-08 05:20:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:18,985 INFO L93 Difference]: Finished difference Result 3354 states and 4418 transitions. [2019-09-08 05:20:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:20:18,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 245 [2019-09-08 05:20:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:19,002 INFO L225 Difference]: With dead ends: 3354 [2019-09-08 05:20:19,002 INFO L226 Difference]: Without dead ends: 2466 [2019-09-08 05:20:19,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:20:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2019-09-08 05:20:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2465. [2019-09-08 05:20:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2019-09-08 05:20:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3267 transitions. [2019-09-08 05:20:19,148 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3267 transitions. Word has length 245 [2019-09-08 05:20:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:19,149 INFO L475 AbstractCegarLoop]: Abstraction has 2465 states and 3267 transitions. [2019-09-08 05:20:19,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:20:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3267 transitions. [2019-09-08 05:20:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 05:20:19,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:19,156 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:19,156 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1352372955, now seen corresponding path program 2 times [2019-09-08 05:20:19,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:20:19,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:20:19,393 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:20:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:20:19,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 05:20:19,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:20:19,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:20:19,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:20:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 05:20:20,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:20:20,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2019-09-08 05:20:20,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:20:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:20:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:20:20,127 INFO L87 Difference]: Start difference. First operand 2465 states and 3267 transitions. Second operand 19 states. [2019-09-08 05:20:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:22,900 INFO L93 Difference]: Finished difference Result 6382 states and 8464 transitions. [2019-09-08 05:20:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 05:20:22,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 245 [2019-09-08 05:20:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:22,932 INFO L225 Difference]: With dead ends: 6382 [2019-09-08 05:20:22,932 INFO L226 Difference]: Without dead ends: 4591 [2019-09-08 05:20:22,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 05:20:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2019-09-08 05:20:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4564. [2019-09-08 05:20:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4564 states. [2019-09-08 05:20:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 6074 transitions. [2019-09-08 05:20:23,212 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 6074 transitions. Word has length 245 [2019-09-08 05:20:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:23,213 INFO L475 AbstractCegarLoop]: Abstraction has 4564 states and 6074 transitions. [2019-09-08 05:20:23,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:20:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 6074 transitions. [2019-09-08 05:20:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 05:20:23,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:23,232 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,233 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash -622539462, now seen corresponding path program 1 times [2019-09-08 05:20:23,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:23,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:23,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:20:23,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:23,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:23,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:23,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:23,540 INFO L87 Difference]: Start difference. First operand 4564 states and 6074 transitions. Second operand 3 states. [2019-09-08 05:20:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:23,901 INFO L93 Difference]: Finished difference Result 13100 states and 18106 transitions. [2019-09-08 05:20:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:23,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-08 05:20:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:23,974 INFO L225 Difference]: With dead ends: 13100 [2019-09-08 05:20:23,974 INFO L226 Difference]: Without dead ends: 8579 [2019-09-08 05:20:23,999 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:20:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8579 states. [2019-09-08 05:20:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8579 to 8564. [2019-09-08 05:20:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8564 states. [2019-09-08 05:20:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8564 states to 8564 states and 11566 transitions. [2019-09-08 05:20:24,527 INFO L78 Accepts]: Start accepts. Automaton has 8564 states and 11566 transitions. Word has length 261 [2019-09-08 05:20:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:24,528 INFO L475 AbstractCegarLoop]: Abstraction has 8564 states and 11566 transitions. [2019-09-08 05:20:24,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 8564 states and 11566 transitions. [2019-09-08 05:20:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 05:20:24,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:24,543 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,543 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1161104574, now seen corresponding path program 1 times [2019-09-08 05:20:24,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:24,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:24,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:24,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:20:25,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:25,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 05:20:25,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:20:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:20:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:20:25,161 INFO L87 Difference]: Start difference. First operand 8564 states and 11566 transitions. Second operand 23 states. [2019-09-08 05:20:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:26,505 INFO L93 Difference]: Finished difference Result 9439 states and 12714 transitions. [2019-09-08 05:20:26,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:20:26,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 254 [2019-09-08 05:20:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:26,549 INFO L225 Difference]: With dead ends: 9439 [2019-09-08 05:20:26,549 INFO L226 Difference]: Without dead ends: 8564 [2019-09-08 05:20:26,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 05:20:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8564 states. [2019-09-08 05:20:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8564 to 8560. [2019-09-08 05:20:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2019-09-08 05:20:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 11558 transitions. [2019-09-08 05:20:26,958 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 11558 transitions. Word has length 254 [2019-09-08 05:20:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:26,959 INFO L475 AbstractCegarLoop]: Abstraction has 8560 states and 11558 transitions. [2019-09-08 05:20:26,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:20:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 11558 transitions. [2019-09-08 05:20:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 05:20:26,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:26,973 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,974 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash 824302545, now seen corresponding path program 1 times [2019-09-08 05:20:26,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:26,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:20:27,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:20:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:20:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:20:27,215 INFO L87 Difference]: Start difference. First operand 8560 states and 11558 transitions. Second operand 3 states. [2019-09-08 05:20:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:27,753 INFO L93 Difference]: Finished difference Result 21005 states and 28692 transitions. [2019-09-08 05:20:27,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:20:27,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 05:20:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:27,823 INFO L225 Difference]: With dead ends: 21005 [2019-09-08 05:20:27,823 INFO L226 Difference]: Without dead ends: 12494 [2019-09-08 05:20:27,863 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:20:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12494 states. [2019-09-08 05:20:28,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12494 to 12491. [2019-09-08 05:20:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12491 states. [2019-09-08 05:20:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 16806 transitions. [2019-09-08 05:20:28,457 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 16806 transitions. Word has length 254 [2019-09-08 05:20:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:28,457 INFO L475 AbstractCegarLoop]: Abstraction has 12491 states and 16806 transitions. [2019-09-08 05:20:28,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:20:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 16806 transitions. [2019-09-08 05:20:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 05:20:28,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:28,477 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,477 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash 537944315, now seen corresponding path program 1 times [2019-09-08 05:20:28,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:28,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:28,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:29,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:29,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 05:20:29,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 05:20:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 05:20:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 05:20:29,766 INFO L87 Difference]: Start difference. First operand 12491 states and 16806 transitions. Second operand 24 states. [2019-09-08 05:20:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:30,758 INFO L93 Difference]: Finished difference Result 19185 states and 25623 transitions. [2019-09-08 05:20:30,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:20:30,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2019-09-08 05:20:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:30,813 INFO L225 Difference]: With dead ends: 19185 [2019-09-08 05:20:30,814 INFO L226 Difference]: Without dead ends: 12754 [2019-09-08 05:20:30,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 05:20:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12754 states. [2019-09-08 05:20:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12754 to 12741. [2019-09-08 05:20:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2019-09-08 05:20:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 17130 transitions. [2019-09-08 05:20:31,524 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 17130 transitions. Word has length 255 [2019-09-08 05:20:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:31,525 INFO L475 AbstractCegarLoop]: Abstraction has 12741 states and 17130 transitions. [2019-09-08 05:20:31,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 05:20:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 17130 transitions. [2019-09-08 05:20:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 05:20:31,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:31,635 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:31,635 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash 636447248, now seen corresponding path program 1 times [2019-09-08 05:20:31,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:31,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:31,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:20:32,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 05:20:32,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:20:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:20:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:20:32,139 INFO L87 Difference]: Start difference. First operand 12741 states and 17130 transitions. Second operand 26 states. [2019-09-08 05:20:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:33,196 INFO L93 Difference]: Finished difference Result 19675 states and 26305 transitions. [2019-09-08 05:20:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:20:33,198 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 264 [2019-09-08 05:20:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:33,259 INFO L225 Difference]: With dead ends: 19675 [2019-09-08 05:20:33,259 INFO L226 Difference]: Without dead ends: 12992 [2019-09-08 05:20:33,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 05:20:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12992 states. [2019-09-08 05:20:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12992 to 12979. [2019-09-08 05:20:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12979 states. [2019-09-08 05:20:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12979 states to 12979 states and 17430 transitions. [2019-09-08 05:20:34,029 INFO L78 Accepts]: Start accepts. Automaton has 12979 states and 17430 transitions. Word has length 264 [2019-09-08 05:20:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:34,030 INFO L475 AbstractCegarLoop]: Abstraction has 12979 states and 17430 transitions. [2019-09-08 05:20:34,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:20:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 12979 states and 17430 transitions. [2019-09-08 05:20:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 05:20:34,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:34,058 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,058 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1916088678, now seen corresponding path program 1 times [2019-09-08 05:20:34,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:20:34,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:34,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 05:20:34,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:20:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:20:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:20:34,478 INFO L87 Difference]: Start difference. First operand 12979 states and 17430 transitions. Second operand 23 states. [2019-09-08 05:20:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:35,772 INFO L93 Difference]: Finished difference Result 14694 states and 19658 transitions. [2019-09-08 05:20:35,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:20:35,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 264 [2019-09-08 05:20:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:35,844 INFO L225 Difference]: With dead ends: 14694 [2019-09-08 05:20:35,844 INFO L226 Difference]: Without dead ends: 12981 [2019-09-08 05:20:35,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 05:20:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2019-09-08 05:20:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12975. [2019-09-08 05:20:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2019-09-08 05:20:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 17422 transitions. [2019-09-08 05:20:36,762 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 17422 transitions. Word has length 264 [2019-09-08 05:20:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:36,763 INFO L475 AbstractCegarLoop]: Abstraction has 12975 states and 17422 transitions. [2019-09-08 05:20:36,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:20:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 17422 transitions. [2019-09-08 05:20:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:20:36,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:36,799 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,800 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:36,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1323652089, now seen corresponding path program 1 times [2019-09-08 05:20:36,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:36,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:20:37,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:37,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 05:20:37,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 05:20:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 05:20:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:20:37,266 INFO L87 Difference]: Start difference. First operand 12975 states and 17422 transitions. Second operand 25 states. [2019-09-08 05:20:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:38,843 INFO L93 Difference]: Finished difference Result 14820 states and 19854 transitions. [2019-09-08 05:20:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 05:20:38,844 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 273 [2019-09-08 05:20:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:38,900 INFO L225 Difference]: With dead ends: 14820 [2019-09-08 05:20:38,900 INFO L226 Difference]: Without dead ends: 12977 [2019-09-08 05:20:38,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=2005, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 05:20:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12977 states. [2019-09-08 05:20:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12977 to 12971. [2019-09-08 05:20:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12971 states. [2019-09-08 05:20:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 17414 transitions. [2019-09-08 05:20:39,552 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 17414 transitions. Word has length 273 [2019-09-08 05:20:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:39,553 INFO L475 AbstractCegarLoop]: Abstraction has 12971 states and 17414 transitions. [2019-09-08 05:20:39,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 05:20:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 17414 transitions. [2019-09-08 05:20:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 05:20:39,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:39,596 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,596 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:39,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:39,597 INFO L82 PathProgramCache]: Analyzing trace with hash 367133957, now seen corresponding path program 1 times [2019-09-08 05:20:39,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:39,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:39,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 05:20:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:40,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:20:40,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:20:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:20:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:20:40,612 INFO L87 Difference]: Start difference. First operand 12971 states and 17414 transitions. Second operand 10 states. [2019-09-08 05:20:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:41,754 INFO L93 Difference]: Finished difference Result 19370 states and 26047 transitions. [2019-09-08 05:20:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:20:41,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 369 [2019-09-08 05:20:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:41,803 INFO L225 Difference]: With dead ends: 19370 [2019-09-08 05:20:41,803 INFO L226 Difference]: Without dead ends: 12971 [2019-09-08 05:20:41,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:20:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12971 states. [2019-09-08 05:20:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12971 to 12971. [2019-09-08 05:20:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12971 states. [2019-09-08 05:20:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 17398 transitions. [2019-09-08 05:20:42,443 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 17398 transitions. Word has length 369 [2019-09-08 05:20:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:42,444 INFO L475 AbstractCegarLoop]: Abstraction has 12971 states and 17398 transitions. [2019-09-08 05:20:42,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:20:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 17398 transitions. [2019-09-08 05:20:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-08 05:20:42,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:42,479 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,480 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2112514605, now seen corresponding path program 1 times [2019-09-08 05:20:42,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:42,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:42,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:42,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-08 05:20:42,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:42,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:20:42,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:20:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:20:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:20:42,927 INFO L87 Difference]: Start difference. First operand 12971 states and 17398 transitions. Second operand 13 states. [2019-09-08 05:20:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:48,846 INFO L93 Difference]: Finished difference Result 29224 states and 39036 transitions. [2019-09-08 05:20:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:20:48,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 377 [2019-09-08 05:20:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:49,054 INFO L225 Difference]: With dead ends: 29224 [2019-09-08 05:20:49,055 INFO L226 Difference]: Without dead ends: 19669 [2019-09-08 05:20:49,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:20:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19669 states. [2019-09-08 05:20:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19669 to 19163. [2019-09-08 05:20:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19163 states. [2019-09-08 05:20:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19163 states to 19163 states and 25758 transitions. [2019-09-08 05:20:49,970 INFO L78 Accepts]: Start accepts. Automaton has 19163 states and 25758 transitions. Word has length 377 [2019-09-08 05:20:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:49,971 INFO L475 AbstractCegarLoop]: Abstraction has 19163 states and 25758 transitions. [2019-09-08 05:20:49,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:20:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19163 states and 25758 transitions. [2019-09-08 05:20:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-08 05:20:50,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:50,021 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:50,022 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1072217212, now seen corresponding path program 1 times [2019-09-08 05:20:50,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-08 05:20:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:20:50,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:20:50,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:20:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:20:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:50,283 INFO L87 Difference]: Start difference. First operand 19163 states and 25758 transitions. Second operand 4 states. [2019-09-08 05:20:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:20:52,300 INFO L93 Difference]: Finished difference Result 61830 states and 88515 transitions. [2019-09-08 05:20:52,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:20:52,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 406 [2019-09-08 05:20:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:20:52,447 INFO L225 Difference]: With dead ends: 61830 [2019-09-08 05:20:52,447 INFO L226 Difference]: Without dead ends: 42973 [2019-09-08 05:20:52,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:20:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42973 states. [2019-09-08 05:20:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42973 to 42970. [2019-09-08 05:20:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42970 states. [2019-09-08 05:20:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42970 states to 42970 states and 59498 transitions. [2019-09-08 05:20:55,870 INFO L78 Accepts]: Start accepts. Automaton has 42970 states and 59498 transitions. Word has length 406 [2019-09-08 05:20:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:20:55,871 INFO L475 AbstractCegarLoop]: Abstraction has 42970 states and 59498 transitions. [2019-09-08 05:20:55,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:20:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42970 states and 59498 transitions. [2019-09-08 05:20:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 05:20:55,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:20:55,957 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,957 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:20:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:20:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1662966137, now seen corresponding path program 1 times [2019-09-08 05:20:55,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:20:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:20:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:55,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:20:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:20:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-08 05:20:57,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:20:57,326 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:20:57,345 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:20:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:20:57,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 4378 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:20:57,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:20:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 159 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:20:58,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:20:58,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [53] total 62 [2019-09-08 05:20:58,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-08 05:20:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-08 05:20:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=3653, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 05:20:58,936 INFO L87 Difference]: Start difference. First operand 42970 states and 59498 transitions. Second operand 62 states. [2019-09-08 05:21:11,209 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-09-08 05:21:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:18,697 INFO L93 Difference]: Finished difference Result 92128 states and 127498 transitions. [2019-09-08 05:21:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-08 05:21:18,697 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 414 [2019-09-08 05:21:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:20,378 INFO L225 Difference]: With dead ends: 92128 [2019-09-08 05:21:20,378 INFO L226 Difference]: Without dead ends: 48488 [2019-09-08 05:21:20,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4348 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=771, Invalid=23721, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 05:21:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48488 states. [2019-09-08 05:21:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48488 to 48170. [2019-09-08 05:21:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48170 states. [2019-09-08 05:21:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48170 states to 48170 states and 66469 transitions. [2019-09-08 05:21:22,186 INFO L78 Accepts]: Start accepts. Automaton has 48170 states and 66469 transitions. Word has length 414 [2019-09-08 05:21:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:22,187 INFO L475 AbstractCegarLoop]: Abstraction has 48170 states and 66469 transitions. [2019-09-08 05:21:22,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-08 05:21:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48170 states and 66469 transitions. [2019-09-08 05:21:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-08 05:21:22,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:22,257 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:22,257 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1042339136, now seen corresponding path program 1 times [2019-09-08 05:21:22,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:22,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-08 05:21:22,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:22,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:22,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:22,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:22,612 INFO L87 Difference]: Start difference. First operand 48170 states and 66469 transitions. Second operand 3 states. [2019-09-08 05:21:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:24,057 INFO L93 Difference]: Finished difference Result 97249 states and 134616 transitions. [2019-09-08 05:21:24,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:24,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 565 [2019-09-08 05:21:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:24,267 INFO L225 Difference]: With dead ends: 97249 [2019-09-08 05:21:24,268 INFO L226 Difference]: Without dead ends: 49430 [2019-09-08 05:21:24,384 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:21:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49430 states. [2019-09-08 05:21:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49430 to 49418. [2019-09-08 05:21:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49418 states. [2019-09-08 05:21:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49418 states to 49418 states and 68497 transitions. [2019-09-08 05:21:28,168 INFO L78 Accepts]: Start accepts. Automaton has 49418 states and 68497 transitions. Word has length 565 [2019-09-08 05:21:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:28,168 INFO L475 AbstractCegarLoop]: Abstraction has 49418 states and 68497 transitions. [2019-09-08 05:21:28,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49418 states and 68497 transitions. [2019-09-08 05:21:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-08 05:21:28,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:28,232 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:28,232 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -789598103, now seen corresponding path program 1 times [2019-09-08 05:21:28,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:28,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:28,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:28,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-08 05:21:28,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:28,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:28,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:28,511 INFO L87 Difference]: Start difference. First operand 49418 states and 68497 transitions. Second operand 3 states. [2019-09-08 05:21:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:30,117 INFO L93 Difference]: Finished difference Result 101491 states and 141516 transitions. [2019-09-08 05:21:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:30,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 566 [2019-09-08 05:21:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:30,337 INFO L225 Difference]: With dead ends: 101491 [2019-09-08 05:21:30,338 INFO L226 Difference]: Without dead ends: 52424 [2019-09-08 05:21:30,445 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:21:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52424 states. [2019-09-08 05:21:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52424 to 52406. [2019-09-08 05:21:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52406 states. [2019-09-08 05:21:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52406 states to 52406 states and 73339 transitions. [2019-09-08 05:21:32,123 INFO L78 Accepts]: Start accepts. Automaton has 52406 states and 73339 transitions. Word has length 566 [2019-09-08 05:21:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:32,123 INFO L475 AbstractCegarLoop]: Abstraction has 52406 states and 73339 transitions. [2019-09-08 05:21:32,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:21:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 52406 states and 73339 transitions. [2019-09-08 05:21:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-08 05:21:32,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:32,222 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:21:32,222 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1642989795, now seen corresponding path program 1 times [2019-09-08 05:21:32,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:32,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-08 05:21:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:33,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:21:33,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:21:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:21:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:21:33,047 INFO L87 Difference]: Start difference. First operand 52406 states and 73339 transitions. Second operand 7 states. [2019-09-08 05:21:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:40,461 INFO L93 Difference]: Finished difference Result 183707 states and 254978 transitions. [2019-09-08 05:21:40,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:21:40,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 569 [2019-09-08 05:21:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:41,080 INFO L225 Difference]: With dead ends: 183707 [2019-09-08 05:21:41,080 INFO L226 Difference]: Without dead ends: 144944 [2019-09-08 05:21:41,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:21:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144944 states. [2019-09-08 05:21:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144944 to 137510. [2019-09-08 05:21:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137510 states. [2019-09-08 05:21:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137510 states to 137510 states and 192098 transitions. [2019-09-08 05:21:46,765 INFO L78 Accepts]: Start accepts. Automaton has 137510 states and 192098 transitions. Word has length 569 [2019-09-08 05:21:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:21:46,765 INFO L475 AbstractCegarLoop]: Abstraction has 137510 states and 192098 transitions. [2019-09-08 05:21:46,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:21:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 137510 states and 192098 transitions. [2019-09-08 05:21:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-09-08 05:21:46,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:21:46,965 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,965 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:21:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:21:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash 708167985, now seen corresponding path program 1 times [2019-09-08 05:21:46,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:21:46,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:21:46,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:46,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:21:46,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:21:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:21:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-08 05:21:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:21:47,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:21:47,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:21:47,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:21:47,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:21:47,174 INFO L87 Difference]: Start difference. First operand 137510 states and 192098 transitions. Second operand 3 states. [2019-09-08 05:21:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:21:53,777 INFO L93 Difference]: Finished difference Result 286177 states and 402782 transitions. [2019-09-08 05:21:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:21:53,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2019-09-08 05:21:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:21:54,305 INFO L225 Difference]: With dead ends: 286177 [2019-09-08 05:21:54,305 INFO L226 Difference]: Without dead ends: 149018 [2019-09-08 05:21:54,534 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:21:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149018 states. [2019-09-08 05:22:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149018 to 148982. [2019-09-08 05:22:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148982 states. [2019-09-08 05:22:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148982 states to 148982 states and 210806 transitions. [2019-09-08 05:22:04,887 INFO L78 Accepts]: Start accepts. Automaton has 148982 states and 210806 transitions. Word has length 468 [2019-09-08 05:22:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:04,887 INFO L475 AbstractCegarLoop]: Abstraction has 148982 states and 210806 transitions. [2019-09-08 05:22:04,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 148982 states and 210806 transitions. [2019-09-08 05:22:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-09-08 05:22:05,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:05,149 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:05,149 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1510086055, now seen corresponding path program 1 times [2019-09-08 05:22:05,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-08 05:22:05,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:05,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:22:05,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:22:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:22:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:22:05,350 INFO L87 Difference]: Start difference. First operand 148982 states and 210806 transitions. Second operand 3 states. [2019-09-08 05:22:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:11,129 INFO L93 Difference]: Finished difference Result 319633 states and 457466 transitions. [2019-09-08 05:22:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:22:11,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 425 [2019-09-08 05:22:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:16,712 INFO L225 Difference]: With dead ends: 319633 [2019-09-08 05:22:16,712 INFO L226 Difference]: Without dead ends: 171002 [2019-09-08 05:22:16,893 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:22:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171002 states. [2019-09-08 05:22:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171002 to 170966. [2019-09-08 05:22:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170966 states. [2019-09-08 05:22:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170966 states to 170966 states and 246542 transitions. [2019-09-08 05:22:23,107 INFO L78 Accepts]: Start accepts. Automaton has 170966 states and 246542 transitions. Word has length 425 [2019-09-08 05:22:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:23,108 INFO L475 AbstractCegarLoop]: Abstraction has 170966 states and 246542 transitions. [2019-09-08 05:22:23,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:22:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 170966 states and 246542 transitions. [2019-09-08 05:22:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-09-08 05:22:23,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:23,409 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:23,409 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash -353353768, now seen corresponding path program 1 times [2019-09-08 05:22:23,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-08 05:22:24,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:24,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:22:24,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:22:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:22:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:22:24,518 INFO L87 Difference]: Start difference. First operand 170966 states and 246542 transitions. Second operand 15 states. [2019-09-08 05:22:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:33,850 INFO L93 Difference]: Finished difference Result 219409 states and 310164 transitions. [2019-09-08 05:22:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:22:33,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 570 [2019-09-08 05:22:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:34,360 INFO L225 Difference]: With dead ends: 219409 [2019-09-08 05:22:34,360 INFO L226 Difference]: Without dead ends: 162060 [2019-09-08 05:22:34,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-09-08 05:22:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162060 states. [2019-09-08 05:22:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162060 to 161036. [2019-09-08 05:22:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161036 states. [2019-09-08 05:22:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161036 states to 161036 states and 230300 transitions. [2019-09-08 05:22:41,122 INFO L78 Accepts]: Start accepts. Automaton has 161036 states and 230300 transitions. Word has length 570 [2019-09-08 05:22:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:22:41,123 INFO L475 AbstractCegarLoop]: Abstraction has 161036 states and 230300 transitions. [2019-09-08 05:22:41,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:22:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 161036 states and 230300 transitions. [2019-09-08 05:22:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-09-08 05:22:41,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:22:41,408 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:22:41,408 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:22:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:22:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1966156158, now seen corresponding path program 1 times [2019-09-08 05:22:41,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:22:41,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:22:41,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:41,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:22:41,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:22:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:22:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 05:22:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:22:41,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:22:41,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:22:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:22:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:22:41,690 INFO L87 Difference]: Start difference. First operand 161036 states and 230300 transitions. Second operand 7 states. [2019-09-08 05:22:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:22:57,115 INFO L93 Difference]: Finished difference Result 327167 states and 468840 transitions. [2019-09-08 05:22:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:22:57,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 426 [2019-09-08 05:22:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:22:58,166 INFO L225 Difference]: With dead ends: 327167 [2019-09-08 05:22:58,166 INFO L226 Difference]: Without dead ends: 284482 [2019-09-08 05:22:58,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:22:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284482 states. [2019-09-08 05:23:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284482 to 284472. [2019-09-08 05:23:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284472 states. [2019-09-08 05:23:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284472 states to 284472 states and 405530 transitions. [2019-09-08 05:23:16,613 INFO L78 Accepts]: Start accepts. Automaton has 284472 states and 405530 transitions. Word has length 426 [2019-09-08 05:23:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:16,613 INFO L475 AbstractCegarLoop]: Abstraction has 284472 states and 405530 transitions. [2019-09-08 05:23:16,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:23:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 284472 states and 405530 transitions. [2019-09-08 05:23:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-09-08 05:23:17,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:17,062 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:17,062 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash -437695047, now seen corresponding path program 1 times [2019-09-08 05:23:17,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:17,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 05:23:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:23:17,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:23:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:23:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:23:17,290 INFO L87 Difference]: Start difference. First operand 284472 states and 405530 transitions. Second operand 3 states. [2019-09-08 05:23:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:23:32,016 INFO L93 Difference]: Finished difference Result 580516 states and 836347 transitions. [2019-09-08 05:23:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:23:32,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 426 [2019-09-08 05:23:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:23:32,939 INFO L225 Difference]: With dead ends: 580516 [2019-09-08 05:23:32,940 INFO L226 Difference]: Without dead ends: 279601 [2019-09-08 05:23:33,355 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:23:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279601 states. [2019-09-08 05:23:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279601 to 278056. [2019-09-08 05:23:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278056 states. [2019-09-08 05:23:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278056 states to 278056 states and 401999 transitions. [2019-09-08 05:23:53,923 INFO L78 Accepts]: Start accepts. Automaton has 278056 states and 401999 transitions. Word has length 426 [2019-09-08 05:23:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:23:53,924 INFO L475 AbstractCegarLoop]: Abstraction has 278056 states and 401999 transitions. [2019-09-08 05:23:53,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:23:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 278056 states and 401999 transitions. [2019-09-08 05:23:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 05:23:54,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:23:54,528 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:23:54,529 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:23:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:23:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1514142850, now seen corresponding path program 1 times [2019-09-08 05:23:54,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:23:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:23:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:54,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:23:54,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:23:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:23:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 05:23:55,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:23:55,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:23:55,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:23:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:23:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:23:55,871 INFO L87 Difference]: Start difference. First operand 278056 states and 401999 transitions. Second operand 3 states. [2019-09-08 05:24:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:12,794 INFO L93 Difference]: Finished difference Result 506398 states and 739957 transitions. [2019-09-08 05:24:12,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:24:12,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-09-08 05:24:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:13,788 INFO L225 Difference]: With dead ends: 506398 [2019-09-08 05:24:13,788 INFO L226 Difference]: Without dead ends: 299505 [2019-09-08 05:24:14,117 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:24:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299505 states. [2019-09-08 05:24:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299505 to 292048. [2019-09-08 05:24:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292048 states. [2019-09-08 05:24:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292048 states to 292048 states and 429652 transitions. [2019-09-08 05:24:28,541 INFO L78 Accepts]: Start accepts. Automaton has 292048 states and 429652 transitions. Word has length 424 [2019-09-08 05:24:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:24:28,542 INFO L475 AbstractCegarLoop]: Abstraction has 292048 states and 429652 transitions. [2019-09-08 05:24:28,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:24:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 292048 states and 429652 transitions. [2019-09-08 05:24:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-08 05:24:29,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:24:29,320 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:29,321 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:24:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:24:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash 89830164, now seen corresponding path program 1 times [2019-09-08 05:24:29,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:24:29,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:24:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:24:29,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:24:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:24:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 05:24:29,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:24:29,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:24:36,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:24:36,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:24:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:24:36,100 INFO L87 Difference]: Start difference. First operand 292048 states and 429652 transitions. Second operand 3 states. [2019-09-08 05:24:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:24:50,967 INFO L93 Difference]: Finished difference Result 699713 states and 1044282 transitions. [2019-09-08 05:24:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:24:50,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-09-08 05:24:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:24:59,448 INFO L225 Difference]: With dead ends: 699713 [2019-09-08 05:24:59,449 INFO L226 Difference]: Without dead ends: 408016 [2019-09-08 05:24:59,940 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:25:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408016 states. [2019-09-08 05:25:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408016 to 407920. [2019-09-08 05:25:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407920 states. [2019-09-08 05:25:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407920 states to 407920 states and 612244 transitions. [2019-09-08 05:25:29,390 INFO L78 Accepts]: Start accepts. Automaton has 407920 states and 612244 transitions. Word has length 442 [2019-09-08 05:25:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:25:29,390 INFO L475 AbstractCegarLoop]: Abstraction has 407920 states and 612244 transitions. [2019-09-08 05:25:29,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:25:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 407920 states and 612244 transitions. [2019-09-08 05:25:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 05:25:32,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:25:32,193 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:25:32,193 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:25:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:25:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1156661578, now seen corresponding path program 1 times [2019-09-08 05:25:32,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:25:32,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:25:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:32,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:25:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-08 05:25:32,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:25:32,433 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:25:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:25:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:25:33,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 4421 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:25:33,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:25:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-08 05:25:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:25:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 05:25:33,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:25:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:25:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:25:33,301 INFO L87 Difference]: Start difference. First operand 407920 states and 612244 transitions. Second operand 14 states. [2019-09-08 05:26:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:26:10,538 INFO L93 Difference]: Finished difference Result 947333 states and 1439012 transitions. [2019-09-08 05:26:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:26:10,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 424 [2019-09-08 05:26:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:26:12,292 INFO L225 Difference]: With dead ends: 947333 [2019-09-08 05:26:12,293 INFO L226 Difference]: Without dead ends: 539482 [2019-09-08 05:26:14,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:26:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539482 states. [2019-09-08 05:27:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539482 to 537511. [2019-09-08 05:27:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537511 states. [2019-09-08 05:27:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537511 states to 537511 states and 818020 transitions. [2019-09-08 05:27:04,017 INFO L78 Accepts]: Start accepts. Automaton has 537511 states and 818020 transitions. Word has length 424 [2019-09-08 05:27:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:27:04,017 INFO L475 AbstractCegarLoop]: Abstraction has 537511 states and 818020 transitions. [2019-09-08 05:27:04,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:27:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 537511 states and 818020 transitions. [2019-09-08 05:27:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-08 05:27:05,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:27:05,921 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:27:05,921 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:27:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:27:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -203397238, now seen corresponding path program 1 times [2019-09-08 05:27:05,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:27:05,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:27:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:05,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:27:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:27:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:27:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 05:27:06,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:27:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:27:06,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:27:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:27:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:27:06,882 INFO L87 Difference]: Start difference. First operand 537511 states and 818020 transitions. Second operand 3 states. [2019-09-08 05:27:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:27:52,201 INFO L93 Difference]: Finished difference Result 1406144 states and 2162547 transitions. [2019-09-08 05:27:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:27:52,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-09-08 05:27:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:27:56,454 INFO L225 Difference]: With dead ends: 1406144 [2019-09-08 05:27:56,454 INFO L226 Difference]: Without dead ends: 869143 [2019-09-08 05:27:57,394 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:27:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869143 states. [2019-09-08 05:29:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869143 to 868999. [2019-09-08 05:29:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868999 states. [2019-09-08 05:29:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868999 states to 868999 states and 1336900 transitions. [2019-09-08 05:29:18,595 INFO L78 Accepts]: Start accepts. Automaton has 868999 states and 1336900 transitions. Word has length 446 [2019-09-08 05:29:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:29:18,596 INFO L475 AbstractCegarLoop]: Abstraction has 868999 states and 1336900 transitions. [2019-09-08 05:29:18,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:29:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 868999 states and 1336900 transitions.