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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/product-lines/email_spec4_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 14:59:18,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 14:59:18,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 14:59:18,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 14:59:18,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 14:59:18,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 14:59:18,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 14:59:18,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 14:59:18,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 14:59:18,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 14:59:18,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 14:59:18,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 14:59:18,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 14:59:18,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 14:59:18,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 14:59:18,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 14:59:18,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 14:59:18,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 14:59:18,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 14:59:18,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 14:59:18,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 14:59:18,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 14:59:18,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 14:59:18,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 14:59:18,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 14:59:18,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 14:59:18,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 14:59:18,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 14:59:18,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 14:59:18,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 14:59:18,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 14:59:18,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 14:59:18,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 14:59:18,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 14:59:18,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 14:59:18,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 14:59:18,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 14:59:18,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 14:59:18,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 14:59:18,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 14:59:18,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 14:59:18,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 14:59:18,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 14:59:18,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 14:59:18,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 14:59:18,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 14:59:18,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 14:59:18,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 14:59:18,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 14:59:18,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 14:59:18,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 14:59:18,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 14:59:18,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 14:59:18,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 14:59:18,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 14:59:18,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 14:59:18,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 14:59:18,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:59:18,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 14:59:18,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 14:59:18,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 14:59:18,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 14:59:18,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 14:59:18,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 14:59:18,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 14:59:18,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 14:59:18,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 14:59:18,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 14:59:18,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 14:59:18,396 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 14:59:18,396 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-10-07 14:59:18,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a4d657b/f3bb26e920154604959465ddd79ebb9c/FLAG49b033693 [2019-10-07 14:59:19,079 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 14:59:19,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_productSimulator.cil.c [2019-10-07 14:59:19,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a4d657b/f3bb26e920154604959465ddd79ebb9c/FLAG49b033693 [2019-10-07 14:59:19,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a4d657b/f3bb26e920154604959465ddd79ebb9c [2019-10-07 14:59:19,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 14:59:19,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 14:59:19,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 14:59:19,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 14:59:19,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 14:59:19,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:59:19" (1/1) ... [2019-10-07 14:59:19,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5381d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:19, skipping insertion in model container [2019-10-07 14:59:19,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:59:19" (1/1) ... [2019-10-07 14:59:19,289 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 14:59:19,368 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 14:59:20,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:59:20,220 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 14:59:20,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:59:20,587 INFO L192 MainTranslator]: Completed translation [2019-10-07 14:59:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20 WrapperNode [2019-10-07 14:59:20,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 14:59:20,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 14:59:20,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 14:59:20,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 14:59:20,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... [2019-10-07 14:59:20,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 14:59:20,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 14:59:20,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 14:59:20,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 14:59:20,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:59:20,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 14:59:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 14:59:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 14:59:20,885 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 14:59:20,886 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-07 14:59:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-07 14:59:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-07 14:59:20,887 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-07 14:59:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-07 14:59:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-07 14:59:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-07 14:59:20,889 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-07 14:59:20,889 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-07 14:59:20,889 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-07 14:59:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-07 14:59:20,890 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-07 14:59:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-07 14:59:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-07 14:59:20,892 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-07 14:59:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-07 14:59:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-07 14:59:20,893 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-07 14:59:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-07 14:59:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-07 14:59:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-07 14:59:20,894 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-07 14:59:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-07 14:59:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-07 14:59:20,895 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-07 14:59:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-07 14:59:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-07 14:59:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-07 14:59:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-07 14:59:20,897 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-07 14:59:20,897 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-07 14:59:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-07 14:59:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 14:59:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-07 14:59:20,898 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-07 14:59:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-07 14:59:20,920 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-07 14:59:20,921 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-07 14:59:20,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-07 14:59:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-07 14:59:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-07 14:59:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-07 14:59:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-07 14:59:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-07 14:59:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-07 14:59:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-07 14:59:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-07 14:59:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-07 14:59:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-07 14:59:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-07 14:59:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 14:59:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 14:59:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 14:59:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 14:59:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-07 14:59:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-07 14:59:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-07 14:59:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-07 14:59:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-07 14:59:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-07 14:59:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-07 14:59:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-07 14:59:20,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-07 14:59:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-07 14:59:20,930 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-07 14:59:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-07 14:59:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-07 14:59:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-07 14:59:20,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-07 14:59:20,932 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-07 14:59:20,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-07 14:59:20,933 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-07 14:59:20,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-07 14:59:20,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-07 14:59:20,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-07 14:59:20,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-07 14:59:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-07 14:59:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-07 14:59:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-07 14:59:20,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-07 14:59:20,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-07 14:59:20,936 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-07 14:59:20,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-07 14:59:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-07 14:59:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-07 14:59:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-07 14:59:20,938 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-07 14:59:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-07 14:59:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-07 14:59:20,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-07 14:59:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-07 14:59:20,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 14:59:20,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 14:59:20,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 14:59:20,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 14:59:20,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 14:59:20,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-10-07 14:59:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 14:59:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 14:59:20,946 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-07 14:59:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-07 14:59:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-07 14:59:20,947 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-07 14:59:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-07 14:59:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-07 14:59:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-07 14:59:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-07 14:59:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-07 14:59:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-07 14:59:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-07 14:59:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-07 14:59:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-07 14:59:20,962 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-07 14:59:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-07 14:59:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-07 14:59:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-07 14:59:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-07 14:59:20,963 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-07 14:59:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-07 14:59:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-07 14:59:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-07 14:59:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-10-07 14:59:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-07 14:59:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-07 14:59:20,966 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-07 14:59:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-07 14:59:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-07 14:59:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-07 14:59:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-07 14:59:20,967 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-07 14:59:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-07 14:59:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 14:59:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-07 14:59:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-07 14:59:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-07 14:59:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-07 14:59:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-07 14:59:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-07 14:59:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-07 14:59:20,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-07 14:59:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-07 14:59:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-07 14:59:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-07 14:59:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-07 14:59:20,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-07 14:59:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-07 14:59:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-07 14:59:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-07 14:59:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-07 14:59:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 14:59:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-07 14:59:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-07 14:59:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-07 14:59:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-07 14:59:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-07 14:59:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-07 14:59:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-07 14:59:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-07 14:59:20,976 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-07 14:59:20,977 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-07 14:59:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-07 14:59:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-07 14:59:20,981 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-07 14:59:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-07 14:59:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-07 14:59:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 14:59:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 14:59:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 14:59:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 14:59:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 14:59:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 14:59:20,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 14:59:20,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 14:59:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 14:59:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 14:59:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 14:59:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 14:59:20,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 14:59:20,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 14:59:25,529 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 14:59:25,529 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 14:59:25,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:59:25 BoogieIcfgContainer [2019-10-07 14:59:25,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 14:59:25,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 14:59:25,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 14:59:25,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 14:59:25,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:59:19" (1/3) ... [2019-10-07 14:59:25,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2834c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:59:25, skipping insertion in model container [2019-10-07 14:59:25,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:59:20" (2/3) ... [2019-10-07 14:59:25,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2834c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:59:25, skipping insertion in model container [2019-10-07 14:59:25,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:59:25" (3/3) ... [2019-10-07 14:59:25,543 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_productSimulator.cil.c [2019-10-07 14:59:25,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 14:59:25,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 14:59:25,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 14:59:25,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 14:59:25,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 14:59:25,617 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 14:59:25,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 14:59:25,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 14:59:25,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 14:59:25,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 14:59:25,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 14:59:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states. [2019-10-07 14:59:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-07 14:59:25,687 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:25,688 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:25,690 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:25,695 INFO L82 PathProgramCache]: Analyzing trace with hash -37475235, now seen corresponding path program 1 times [2019-10-07 14:59:25,705 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:25,705 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:25,706 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:25,706 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:59:26,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:26,411 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:26,411 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:59:26,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:59:26,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:59:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:59:26,432 INFO L87 Difference]: Start difference. First operand 607 states. Second operand 6 states. [2019-10-07 14:59:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:26,617 INFO L93 Difference]: Finished difference Result 1136 states and 1426 transitions. [2019-10-07 14:59:26,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:59:26,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-07 14:59:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:26,659 INFO L225 Difference]: With dead ends: 1136 [2019-10-07 14:59:26,660 INFO L226 Difference]: Without dead ends: 580 [2019-10-07 14:59:26,673 INFO L606 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-10-07 14:59:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-07 14:59:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-07 14:59:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-07 14:59:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 715 transitions. [2019-10-07 14:59:26,804 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 715 transitions. Word has length 144 [2019-10-07 14:59:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:26,810 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 715 transitions. [2019-10-07 14:59:26,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:59:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 715 transitions. [2019-10-07 14:59:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 14:59:26,818 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:26,818 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 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] [2019-10-07 14:59:26,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash -75929238, now seen corresponding path program 1 times [2019-10-07 14:59:26,819 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:26,820 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:26,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:26,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:26,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:59:27,116 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:27,117 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:27,117 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:59:27,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:59:27,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:59:27,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:59:27,120 INFO L87 Difference]: Start difference. First operand 580 states and 715 transitions. Second operand 4 states. [2019-10-07 14:59:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:27,875 INFO L93 Difference]: Finished difference Result 1122 states and 1404 transitions. [2019-10-07 14:59:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:59:27,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-07 14:59:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:27,881 INFO L225 Difference]: With dead ends: 1122 [2019-10-07 14:59:27,881 INFO L226 Difference]: Without dead ends: 580 [2019-10-07 14:59:27,883 INFO L606 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-10-07 14:59:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-07 14:59:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-07 14:59:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-07 14:59:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 708 transitions. [2019-10-07 14:59:27,930 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 708 transitions. Word has length 150 [2019-10-07 14:59:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:27,930 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 708 transitions. [2019-10-07 14:59:27,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:59:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 708 transitions. [2019-10-07 14:59:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 14:59:27,933 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:27,934 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 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] [2019-10-07 14:59:27,934 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:27,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 953045078, now seen corresponding path program 1 times [2019-10-07 14:59:27,935 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:27,935 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:27,935 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:27,935 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 14:59:28,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:28,131 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:28,132 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:59:28,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:59:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:59:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:28,134 INFO L87 Difference]: Start difference. First operand 580 states and 708 transitions. Second operand 3 states. [2019-10-07 14:59:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:28,328 INFO L93 Difference]: Finished difference Result 1116 states and 1382 transitions. [2019-10-07 14:59:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:59:28,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-07 14:59:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:28,337 INFO L225 Difference]: With dead ends: 1116 [2019-10-07 14:59:28,337 INFO L226 Difference]: Without dead ends: 578 [2019-10-07 14:59:28,340 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-07 14:59:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-07 14:59:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-07 14:59:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 701 transitions. [2019-10-07 14:59:28,398 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 701 transitions. Word has length 163 [2019-10-07 14:59:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:28,399 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 701 transitions. [2019-10-07 14:59:28,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:59:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 701 transitions. [2019-10-07 14:59:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 14:59:28,402 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:28,403 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:28,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1488083693, now seen corresponding path program 1 times [2019-10-07 14:59:28,404 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:28,404 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:28,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:28,405 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 14:59:28,610 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:28,611 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:28,611 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:59:28,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:59:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:59:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:59:28,612 INFO L87 Difference]: Start difference. First operand 578 states and 701 transitions. Second operand 4 states. [2019-10-07 14:59:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:29,303 INFO L93 Difference]: Finished difference Result 1101 states and 1333 transitions. [2019-10-07 14:59:29,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:59:29,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-07 14:59:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:29,352 INFO L225 Difference]: With dead ends: 1101 [2019-10-07 14:59:29,352 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 14:59:29,354 INFO L606 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-10-07 14:59:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 14:59:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2019-10-07 14:59:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-07 14:59:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 685 transitions. [2019-10-07 14:59:29,384 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 685 transitions. Word has length 164 [2019-10-07 14:59:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:29,385 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 685 transitions. [2019-10-07 14:59:29,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:59:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 685 transitions. [2019-10-07 14:59:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-07 14:59:29,388 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:29,389 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:29,389 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:29,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1836470284, now seen corresponding path program 1 times [2019-10-07 14:59:29,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:29,390 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:29,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:59:29,575 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:29,575 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:29,575 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:59:29,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:59:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:59:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:29,577 INFO L87 Difference]: Start difference. First operand 577 states and 685 transitions. Second operand 3 states. [2019-10-07 14:59:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:29,615 INFO L93 Difference]: Finished difference Result 907 states and 1071 transitions. [2019-10-07 14:59:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:59:29,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-07 14:59:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:29,622 INFO L225 Difference]: With dead ends: 907 [2019-10-07 14:59:29,622 INFO L226 Difference]: Without dead ends: 579 [2019-10-07 14:59:29,624 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-07 14:59:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-07 14:59:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 14:59:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 687 transitions. [2019-10-07 14:59:29,659 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 687 transitions. Word has length 185 [2019-10-07 14:59:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:29,659 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 687 transitions. [2019-10-07 14:59:29,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:59:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 687 transitions. [2019-10-07 14:59:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 14:59:29,664 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:29,664 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:29,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1720370243, now seen corresponding path program 1 times [2019-10-07 14:59:29,666 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:29,666 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:29,666 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,666 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:59:29,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:29,846 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:29,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:59:29,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:59:29,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:59:29,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:29,847 INFO L87 Difference]: Start difference. First operand 579 states and 687 transitions. Second operand 3 states. [2019-10-07 14:59:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:29,900 INFO L93 Difference]: Finished difference Result 1104 states and 1342 transitions. [2019-10-07 14:59:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:59:29,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-07 14:59:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:29,906 INFO L225 Difference]: With dead ends: 1104 [2019-10-07 14:59:29,907 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 14:59:29,909 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:59:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 14:59:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 632. [2019-10-07 14:59:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-07 14:59:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 774 transitions. [2019-10-07 14:59:29,953 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 774 transitions. Word has length 192 [2019-10-07 14:59:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:29,955 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 774 transitions. [2019-10-07 14:59:29,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:59:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 774 transitions. [2019-10-07 14:59:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-07 14:59:29,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:29,959 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:29,959 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -603718544, now seen corresponding path program 1 times [2019-10-07 14:59:29,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:29,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:29,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:59:30,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:30,714 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:30,714 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-07 14:59:30,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 14:59:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 14:59:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2019-10-07 14:59:30,717 INFO L87 Difference]: Start difference. First operand 632 states and 774 transitions. Second operand 25 states. [2019-10-07 14:59:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:45,227 INFO L93 Difference]: Finished difference Result 1314 states and 1583 transitions. [2019-10-07 14:59:45,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 14:59:45,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 193 [2019-10-07 14:59:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:45,234 INFO L225 Difference]: With dead ends: 1314 [2019-10-07 14:59:45,235 INFO L226 Difference]: Without dead ends: 988 [2019-10-07 14:59:45,237 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=2215, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 14:59:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-10-07 14:59:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 979. [2019-10-07 14:59:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-10-07 14:59:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1185 transitions. [2019-10-07 14:59:45,300 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1185 transitions. Word has length 193 [2019-10-07 14:59:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:45,301 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1185 transitions. [2019-10-07 14:59:45,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 14:59:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1185 transitions. [2019-10-07 14:59:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-07 14:59:45,305 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:45,305 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:45,306 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash 956600800, now seen corresponding path program 1 times [2019-10-07 14:59:45,306 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:45,307 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:45,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:45,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:59:45,985 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:45,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:45,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-10-07 14:59:45,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 14:59:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 14:59:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2019-10-07 14:59:45,988 INFO L87 Difference]: Start difference. First operand 979 states and 1185 transitions. Second operand 27 states. [2019-10-07 14:59:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:59:48,627 INFO L93 Difference]: Finished difference Result 1073 states and 1301 transitions. [2019-10-07 14:59:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 14:59:48,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 199 [2019-10-07 14:59:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:59:48,635 INFO L225 Difference]: With dead ends: 1073 [2019-10-07 14:59:48,636 INFO L226 Difference]: Without dead ends: 1064 [2019-10-07 14:59:48,637 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=2723, Unknown=0, NotChecked=0, Total=2970 [2019-10-07 14:59:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-07 14:59:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1057. [2019-10-07 14:59:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-07 14:59:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1283 transitions. [2019-10-07 14:59:48,722 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1283 transitions. Word has length 199 [2019-10-07 14:59:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:59:48,725 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1283 transitions. [2019-10-07 14:59:48,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 14:59:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1283 transitions. [2019-10-07 14:59:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 14:59:48,729 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:59:48,729 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:59:48,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:59:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:59:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1166610870, now seen corresponding path program 1 times [2019-10-07 14:59:48,730 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:59:48,730 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:48,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:48,730 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:59:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:59:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:59:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:59:49,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:59:49,355 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:59:49,356 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-10-07 14:59:49,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 14:59:49,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 14:59:49,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-10-07 14:59:49,357 INFO L87 Difference]: Start difference. First operand 1057 states and 1283 transitions. Second operand 27 states. [2019-10-07 15:00:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:04,539 INFO L93 Difference]: Finished difference Result 1705 states and 2055 transitions. [2019-10-07 15:00:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 15:00:04,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 200 [2019-10-07 15:00:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:04,547 INFO L225 Difference]: With dead ends: 1705 [2019-10-07 15:00:04,547 INFO L226 Difference]: Without dead ends: 1113 [2019-10-07 15:00:04,550 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=2607, Unknown=0, NotChecked=0, Total=2862 [2019-10-07 15:00:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-10-07 15:00:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1101. [2019-10-07 15:00:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-10-07 15:00:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1342 transitions. [2019-10-07 15:00:04,607 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1342 transitions. Word has length 200 [2019-10-07 15:00:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:04,608 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1342 transitions. [2019-10-07 15:00:04,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 15:00:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1342 transitions. [2019-10-07 15:00:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-07 15:00:04,612 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:04,612 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:04,612 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:04,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2024167782, now seen corresponding path program 1 times [2019-10-07 15:00:04,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:04,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:04,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:04,613 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:04,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:04,760 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:04,760 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:00:04,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:00:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:00:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:00:04,762 INFO L87 Difference]: Start difference. First operand 1101 states and 1342 transitions. Second operand 3 states. [2019-10-07 15:00:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:04,893 INFO L93 Difference]: Finished difference Result 3079 states and 3926 transitions. [2019-10-07 15:00:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:00:04,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-07 15:00:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:04,907 INFO L225 Difference]: With dead ends: 3079 [2019-10-07 15:00:04,907 INFO L226 Difference]: Without dead ends: 2015 [2019-10-07 15:00:04,913 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:00:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-10-07 15:00:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2012. [2019-10-07 15:00:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-10-07 15:00:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2490 transitions. [2019-10-07 15:00:05,045 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2490 transitions. Word has length 204 [2019-10-07 15:00:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:05,046 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 2490 transitions. [2019-10-07 15:00:05,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:00:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2490 transitions. [2019-10-07 15:00:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-07 15:00:05,052 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:05,052 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:05,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:05,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1058560730, now seen corresponding path program 1 times [2019-10-07 15:00:05,053 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:05,053 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:05,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:05,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:05,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:05,666 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:05,666 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-07 15:00:05,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 15:00:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 15:00:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2019-10-07 15:00:05,668 INFO L87 Difference]: Start difference. First operand 2012 states and 2490 transitions. Second operand 29 states. [2019-10-07 15:00:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:08,375 INFO L93 Difference]: Finished difference Result 2108 states and 2587 transitions. [2019-10-07 15:00:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 15:00:08,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 206 [2019-10-07 15:00:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:08,397 INFO L225 Difference]: With dead ends: 2108 [2019-10-07 15:00:08,397 INFO L226 Difference]: Without dead ends: 2105 [2019-10-07 15:00:08,401 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=3155, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 15:00:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2019-10-07 15:00:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2093. [2019-10-07 15:00:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2019-10-07 15:00:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2572 transitions. [2019-10-07 15:00:08,580 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2572 transitions. Word has length 206 [2019-10-07 15:00:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:08,581 INFO L462 AbstractCegarLoop]: Abstraction has 2093 states and 2572 transitions. [2019-10-07 15:00:08,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 15:00:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2572 transitions. [2019-10-07 15:00:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-07 15:00:08,590 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:08,591 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:08,591 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:08,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1974688678, now seen corresponding path program 1 times [2019-10-07 15:00:08,592 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:08,592 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:08,593 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:08,593 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:08,739 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:08,739 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:08,739 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:00:08,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:00:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:00:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:00:08,741 INFO L87 Difference]: Start difference. First operand 2093 states and 2572 transitions. Second operand 3 states. [2019-10-07 15:00:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:08,953 INFO L93 Difference]: Finished difference Result 5124 states and 6399 transitions. [2019-10-07 15:00:08,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:00:08,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-07 15:00:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:08,972 INFO L225 Difference]: With dead ends: 5124 [2019-10-07 15:00:08,973 INFO L226 Difference]: Without dead ends: 3073 [2019-10-07 15:00:08,983 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:00:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2019-10-07 15:00:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3070. [2019-10-07 15:00:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2019-10-07 15:00:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3750 transitions. [2019-10-07 15:00:09,215 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3750 transitions. Word has length 206 [2019-10-07 15:00:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:09,216 INFO L462 AbstractCegarLoop]: Abstraction has 3070 states and 3750 transitions. [2019-10-07 15:00:09,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:00:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3750 transitions. [2019-10-07 15:00:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-07 15:00:09,226 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:09,227 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:09,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:09,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1696728888, now seen corresponding path program 1 times [2019-10-07 15:00:09,228 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:09,228 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:09,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:09,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:09,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:09,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:09,866 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:09,866 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-10-07 15:00:09,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 15:00:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 15:00:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:00:09,867 INFO L87 Difference]: Start difference. First operand 3070 states and 3750 transitions. Second operand 27 states. [2019-10-07 15:00:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:25,134 INFO L93 Difference]: Finished difference Result 4259 states and 5155 transitions. [2019-10-07 15:00:25,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 15:00:25,137 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 207 [2019-10-07 15:00:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:25,155 INFO L225 Difference]: With dead ends: 4259 [2019-10-07 15:00:25,155 INFO L226 Difference]: Without dead ends: 3140 [2019-10-07 15:00:25,161 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=2607, Unknown=0, NotChecked=0, Total=2862 [2019-10-07 15:00:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-07 15:00:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3108. [2019-10-07 15:00:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2019-10-07 15:00:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 3797 transitions. [2019-10-07 15:00:25,324 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 3797 transitions. Word has length 207 [2019-10-07 15:00:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:25,325 INFO L462 AbstractCegarLoop]: Abstraction has 3108 states and 3797 transitions. [2019-10-07 15:00:25,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 15:00:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 3797 transitions. [2019-10-07 15:00:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-07 15:00:25,337 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:25,338 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:25,338 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:25,339 INFO L82 PathProgramCache]: Analyzing trace with hash 499222088, now seen corresponding path program 1 times [2019-10-07 15:00:25,339 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:25,339 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:25,339 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:25,339 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:25,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:25,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:25,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:25,915 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-07 15:00:25,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 15:00:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 15:00:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2019-10-07 15:00:25,917 INFO L87 Difference]: Start difference. First operand 3108 states and 3797 transitions. Second operand 29 states. [2019-10-07 15:00:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:28,303 INFO L93 Difference]: Finished difference Result 3184 states and 3871 transitions. [2019-10-07 15:00:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 15:00:28,304 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 213 [2019-10-07 15:00:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:28,321 INFO L225 Difference]: With dead ends: 3184 [2019-10-07 15:00:28,321 INFO L226 Difference]: Without dead ends: 3181 [2019-10-07 15:00:28,324 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=3155, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 15:00:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-10-07 15:00:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3159. [2019-10-07 15:00:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2019-10-07 15:00:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 3846 transitions. [2019-10-07 15:00:28,490 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 3846 transitions. Word has length 213 [2019-10-07 15:00:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:28,491 INFO L462 AbstractCegarLoop]: Abstraction has 3159 states and 3846 transitions. [2019-10-07 15:00:28,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 15:00:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 3846 transitions. [2019-10-07 15:00:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-07 15:00:28,502 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:28,502 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:28,502 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash -837280454, now seen corresponding path program 1 times [2019-10-07 15:00:28,503 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:28,503 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:29,106 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:29,106 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:29,106 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-10-07 15:00:29,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 15:00:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 15:00:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-10-07 15:00:29,108 INFO L87 Difference]: Start difference. First operand 3159 states and 3846 transitions. Second operand 29 states. [2019-10-07 15:00:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:45,927 INFO L93 Difference]: Finished difference Result 4389 states and 5311 transitions. [2019-10-07 15:00:45,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 15:00:45,928 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 214 [2019-10-07 15:00:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:45,943 INFO L225 Difference]: With dead ends: 4389 [2019-10-07 15:00:45,944 INFO L226 Difference]: Without dead ends: 3231 [2019-10-07 15:00:45,949 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=275, Invalid=3031, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 15:00:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2019-10-07 15:00:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3197. [2019-10-07 15:00:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3197 states. [2019-10-07 15:00:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 3893 transitions. [2019-10-07 15:00:46,097 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 3893 transitions. Word has length 214 [2019-10-07 15:00:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:46,098 INFO L462 AbstractCegarLoop]: Abstraction has 3197 states and 3893 transitions. [2019-10-07 15:00:46,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 15:00:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 3893 transitions. [2019-10-07 15:00:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-07 15:00:46,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:46,107 INFO L385 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:46,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 669944874, now seen corresponding path program 1 times [2019-10-07 15:00:46,107 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:46,108 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:46,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:46,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:46,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 15:00:46,837 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:46,840 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:46,840 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-10-07 15:00:46,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-07 15:00:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-07 15:00:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2019-10-07 15:00:46,842 INFO L87 Difference]: Start difference. First operand 3197 states and 3893 transitions. Second operand 31 states. [2019-10-07 15:00:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:53,438 INFO L93 Difference]: Finished difference Result 3275 states and 3969 transitions. [2019-10-07 15:00:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-07 15:00:53,439 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 220 [2019-10-07 15:00:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:53,454 INFO L225 Difference]: With dead ends: 3275 [2019-10-07 15:00:53,454 INFO L226 Difference]: Without dead ends: 3272 [2019-10-07 15:00:53,458 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=3619, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 15:00:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-10-07 15:00:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3248. [2019-10-07 15:00:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-10-07 15:00:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 3942 transitions. [2019-10-07 15:00:53,602 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 3942 transitions. Word has length 220 [2019-10-07 15:00:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:53,603 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 3942 transitions. [2019-10-07 15:00:53,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-07 15:00:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 3942 transitions. [2019-10-07 15:00:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-07 15:00:53,617 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:53,618 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:53,619 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1617644745, now seen corresponding path program 1 times [2019-10-07 15:00:53,619 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:53,620 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:53,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:53,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-07 15:00:53,875 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:53,875 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:53,875 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 15:00:53,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 15:00:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 15:00:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-07 15:00:53,876 INFO L87 Difference]: Start difference. First operand 3248 states and 3942 transitions. Second operand 10 states. [2019-10-07 15:00:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:54,775 INFO L93 Difference]: Finished difference Result 4545 states and 5539 transitions. [2019-10-07 15:00:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 15:00:54,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 311 [2019-10-07 15:00:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:54,789 INFO L225 Difference]: With dead ends: 4545 [2019-10-07 15:00:54,790 INFO L226 Difference]: Without dead ends: 3248 [2019-10-07 15:00:54,795 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-07 15:00:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-10-07 15:00:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3248. [2019-10-07 15:00:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-10-07 15:00:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 3938 transitions. [2019-10-07 15:00:54,938 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 3938 transitions. Word has length 311 [2019-10-07 15:00:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:54,939 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 3938 transitions. [2019-10-07 15:00:54,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 15:00:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 3938 transitions. [2019-10-07 15:00:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-07 15:00:54,951 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:54,951 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:54,952 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 780591229, now seen corresponding path program 1 times [2019-10-07 15:00:54,952 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:54,953 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:54,953 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:54,953 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 15:00:55,260 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:55,260 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:55,260 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 15:00:55,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 15:00:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 15:00:55,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-07 15:00:55,262 INFO L87 Difference]: Start difference. First operand 3248 states and 3938 transitions. Second operand 13 states. [2019-10-07 15:00:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:00:59,214 INFO L93 Difference]: Finished difference Result 6640 states and 8041 transitions. [2019-10-07 15:00:59,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:00:59,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 316 [2019-10-07 15:00:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:00:59,237 INFO L225 Difference]: With dead ends: 6640 [2019-10-07 15:00:59,237 INFO L226 Difference]: Without dead ends: 4881 [2019-10-07 15:00:59,244 INFO L606 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-10-07 15:00:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2019-10-07 15:00:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4777. [2019-10-07 15:00:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4777 states. [2019-10-07 15:00:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 5800 transitions. [2019-10-07 15:00:59,468 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 5800 transitions. Word has length 316 [2019-10-07 15:00:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:00:59,468 INFO L462 AbstractCegarLoop]: Abstraction has 4777 states and 5800 transitions. [2019-10-07 15:00:59,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 15:00:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 5800 transitions. [2019-10-07 15:00:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-07 15:00:59,484 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:00:59,484 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:00:59,485 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:00:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:00:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -657414697, now seen corresponding path program 1 times [2019-10-07 15:00:59,486 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:00:59,486 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:59,486 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:59,486 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:00:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:00:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:00:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 15:00:59,719 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:00:59,719 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:00:59,719 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:00:59,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:00:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:00:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:00:59,725 INFO L87 Difference]: Start difference. First operand 4777 states and 5800 transitions. Second operand 4 states. [2019-10-07 15:01:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:01:00,969 INFO L93 Difference]: Finished difference Result 15229 states and 20175 transitions. [2019-10-07 15:01:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:01:00,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-10-07 15:01:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:01:01,017 INFO L225 Difference]: With dead ends: 15229 [2019-10-07 15:01:01,018 INFO L226 Difference]: Without dead ends: 10700 [2019-10-07 15:01:01,038 INFO L606 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-10-07 15:01:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10700 states. [2019-10-07 15:01:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10700 to 10697. [2019-10-07 15:01:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10697 states. [2019-10-07 15:01:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10697 states to 10697 states and 13494 transitions. [2019-10-07 15:01:01,611 INFO L78 Accepts]: Start accepts. Automaton has 10697 states and 13494 transitions. Word has length 339 [2019-10-07 15:01:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:01:01,612 INFO L462 AbstractCegarLoop]: Abstraction has 10697 states and 13494 transitions. [2019-10-07 15:01:01,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:01:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10697 states and 13494 transitions. [2019-10-07 15:01:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-07 15:01:01,649 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:01:01,650 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:01:01,650 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:01:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:01:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1598432383, now seen corresponding path program 1 times [2019-10-07 15:01:01,651 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:01:01,651 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:01:01,651 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:01:01,651 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:01:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:01:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:01:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 15:01:01,842 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:01:01,842 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:01:01,842 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:01:01,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:01:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:01:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:01:01,844 INFO L87 Difference]: Start difference. First operand 10697 states and 13494 transitions. Second operand 3 states. [2019-10-07 15:01:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:01:02,236 INFO L93 Difference]: Finished difference Result 21762 states and 27726 transitions. [2019-10-07 15:01:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:01:02,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2019-10-07 15:01:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:01:02,278 INFO L225 Difference]: With dead ends: 21762 [2019-10-07 15:01:02,279 INFO L226 Difference]: Without dead ends: 11315 [2019-10-07 15:01:02,308 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:01:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11315 states. [2019-10-07 15:01:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11315 to 11309. [2019-10-07 15:01:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11309 states. [2019-10-07 15:01:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11309 states to 11309 states and 14478 transitions. [2019-10-07 15:01:02,779 INFO L78 Accepts]: Start accepts. Automaton has 11309 states and 14478 transitions. Word has length 343 [2019-10-07 15:01:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:01:02,779 INFO L462 AbstractCegarLoop]: Abstraction has 11309 states and 14478 transitions. [2019-10-07 15:01:02,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:01:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11309 states and 14478 transitions. [2019-10-07 15:01:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-07 15:01:02,813 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:01:02,813 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:01:02,813 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:01:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:01:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 869809909, now seen corresponding path program 1 times [2019-10-07 15:01:02,814 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:01:02,814 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:01:02,814 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:01:02,814 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:01:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:01:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:01:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 15:01:05,141 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:01:05,141 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:01:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:01:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:01:05,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 4240 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:01:05,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:01:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-07 15:01:06,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:01:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-07 15:01:07,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:01:07,170 INFO L162 IcfgInterpreter]: Started Sifa with 277 locations of interest [2019-10-07 15:01:07,170 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:01:07,180 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:01:07,188 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:01:07,189 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:02:13,361 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 707 [2019-10-07 15:02:17,660 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 341 DAG size of output: 277 [2019-10-07 15:02:18,080 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 754 [2019-10-07 15:02:18,421 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 754 [2019-10-07 15:02:18,669 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 754 [2019-10-07 15:02:18,814 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 15:02:19,492 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:20,149 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:20,806 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:20,938 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 15:02:21,570 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:22,848 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 1054 DAG size of output: 1052 [2019-10-07 15:02:23,475 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:23,633 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 15:02:24,261 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:24,883 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:25,547 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:25,674 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 15:02:26,301 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 1052 [2019-10-07 15:02:26,330 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 568 for LOIs [2019-10-07 15:02:26,795 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 671 [2019-10-07 15:02:26,924 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 671 [2019-10-07 15:02:27,056 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 15:02:27,517 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 969 [2019-10-07 15:02:27,519 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1122 for LOIs [2019-10-07 15:02:28,124 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1122 [2019-10-07 15:02:28,766 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 1122 [2019-10-07 15:02:29,054 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:30,186 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:30,820 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 1122 [2019-10-07 15:02:31,432 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 1122 [2019-10-07 15:02:31,779 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:32,919 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:33,572 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:34,202 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:34,543 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:35,695 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:36,766 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 1366 DAG size of output: 1124 [2019-10-07 15:02:37,367 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:37,680 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:38,772 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:39,423 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:40,031 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:40,386 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:41,516 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:42,130 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:42,738 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:43,021 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:44,159 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:44,766 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:45,376 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:45,659 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:46,773 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:47,385 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:48,011 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:48,288 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:49,385 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:49,989 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:50,588 WARN L191 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:50,864 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:51,983 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:52,587 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:53,190 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:53,463 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:54,555 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:55,156 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:55,757 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:56,031 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:57,150 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:02:57,757 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:58,366 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:02:58,646 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:02:59,740 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:03:00,348 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:03:00,962 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 1124 [2019-10-07 15:03:01,238 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 15:03:02,344 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1364 [2019-10-07 15:03:02,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:03:02,694 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee select_one at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee select_one at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 15:03:02,701 INFO L168 Benchmark]: Toolchain (without parser) took 223427.01 ms. Allocated memory was 144.7 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 99.4 MB in the beginning and 609.8 MB in the end (delta: -510.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,701 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1314.53 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.2 MB in the beginning and 105.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,702 INFO L168 Benchmark]: Boogie Preprocessor took 195.53 ms. Allocated memory is still 202.9 MB. Free memory was 105.3 MB in the beginning and 95.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,706 INFO L168 Benchmark]: RCFGBuilder took 4747.20 ms. Allocated memory was 202.9 MB in the beginning and 299.4 MB in the end (delta: 96.5 MB). Free memory was 95.3 MB in the beginning and 197.9 MB in the end (delta: -102.6 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,707 INFO L168 Benchmark]: TraceAbstraction took 217165.37 ms. Allocated memory was 299.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 197.9 MB in the beginning and 609.8 MB in the end (delta: -411.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-07 15:03:02,710 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1314.53 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.2 MB in the beginning and 105.3 MB in the end (delta: -6.0 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 195.53 ms. Allocated memory is still 202.9 MB. Free memory was 105.3 MB in the beginning and 95.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4747.20 ms. Allocated memory was 202.9 MB in the beginning and 299.4 MB in the end (delta: 96.5 MB). Free memory was 95.3 MB in the beginning and 197.9 MB in the end (delta: -102.6 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217165.37 ms. Allocated memory was 299.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 197.9 MB in the beginning and 609.8 MB in the end (delta: -411.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee select_one de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee select_one: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...