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_spec8_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:10:02,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:10:02,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:10:02,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:10:02,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:10:02,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:10:02,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:10:02,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:10:02,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:10:02,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:10:02,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:10:02,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:10:02,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:10:02,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:10:02,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:10:02,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:10:02,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:10:02,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:10:02,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:10:02,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:10:02,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:10:02,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:10:02,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:10:02,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:10:02,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:10:02,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:10:02,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:10:02,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:10:02,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:10:02,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:10:02,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:10:02,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:10:02,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:10:02,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:10:02,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:10:02,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:10:02,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:10:02,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:10:02,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:10:02,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:10:02,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:10:02,333 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 15:10:02,362 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:10:02,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:10:02,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:10:02,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:10:02,364 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:10:02,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:10:02,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:10:02,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:10:02,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:10:02,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:10:02,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:10:02,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:10:02,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:10:02,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:10:02,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:10:02,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:10:02,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:10:02,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:10:02,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:10:02,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:10:02,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:10:02,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:10:02,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:10:02,368 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 15:10:02,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:10:02,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:10:02,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:10:02,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:10:02,686 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:10:02,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_productSimulator.cil.c [2019-10-07 15:10:02,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccff2ec5/31a6b2c7f3194abe880b7da30b137124/FLAG1ad432c74 [2019-10-07 15:10:03,422 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:10:03,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_productSimulator.cil.c [2019-10-07 15:10:03,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccff2ec5/31a6b2c7f3194abe880b7da30b137124/FLAG1ad432c74 [2019-10-07 15:10:03,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccff2ec5/31a6b2c7f3194abe880b7da30b137124 [2019-10-07 15:10:03,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:10:03,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:10:03,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:10:03,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:10:03,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:10:03,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:10:03" (1/1) ... [2019-10-07 15:10:03,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f542093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:03, skipping insertion in model container [2019-10-07 15:10:03,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:10:03" (1/1) ... [2019-10-07 15:10:03,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:10:03,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:10:04,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:10:04,602 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:10:04,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:10:04,968 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:10:04,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04 WrapperNode [2019-10-07 15:10:04,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:10:04,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:10:04,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:10:04,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:10:04,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:04,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (1/1) ... [2019-10-07 15:10:05,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:10:05,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:10:05,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:10:05,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:10:05,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (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 15:10:05,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:10:05,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:10:05,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 15:10:05,304 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 15:10:05,304 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 15:10:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 15:10:05,306 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 15:10:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 15:10:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-07 15:10:05,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 15:10:05,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 15:10:05,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 15:10:05,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 15:10:05,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 15:10:05,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 15:10:05,310 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-07 15:10:05,312 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-07 15:10:05,313 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-07 15:10:05,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-07 15:10:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-07 15:10:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-07 15:10:05,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-07 15:10:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-07 15:10:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-07 15:10:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-07 15:10:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-07 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-07 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-07 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-07 15:10:05,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-07 15:10:05,317 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-07 15:10:05,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-07 15:10:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-07 15:10:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-07 15:10:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-07 15:10:05,318 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-07 15:10:05,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-07 15:10:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-07 15:10:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-07 15:10:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-07 15:10:05,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-07 15:10:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-07 15:10:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-07 15:10:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-07 15:10:05,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-07 15:10:05,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-07 15:10:05,346 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-07 15:10:05,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-07 15:10:05,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-07 15:10:05,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-07 15:10:05,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-07 15:10:05,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-07 15:10:05,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-07 15:10:05,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-07 15:10:05,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-07 15:10:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-07 15:10:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-07 15:10:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-07 15:10:05,349 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-07 15:10:05,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-07 15:10:05,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-07 15:10:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-07 15:10:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-07 15:10:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-07 15:10:05,352 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-07 15:10:05,352 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-07 15:10:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-07 15:10:05,354 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-07 15:10:05,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-07 15:10:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-07 15:10:05,356 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-07 15:10:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-07 15:10:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-07 15:10:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-07 15:10:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-07 15:10:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-07 15:10:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-07 15:10:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-07 15:10:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-07 15:10:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-07 15:10:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-07 15:10:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-07 15:10:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-07 15:10:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-07 15:10:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-07 15:10:05,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-07 15:10:05,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-07 15:10:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-07 15:10:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-07 15:10:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-07 15:10:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 15:10:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:10:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-07 15:10:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-07 15:10:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-07 15:10:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-07 15:10:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-07 15:10:05,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-07 15:10:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-07 15:10:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 15:10:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:10:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:10:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 15:10:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 15:10:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 15:10:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 15:10:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-07 15:10:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-07 15:10:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-07 15:10:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-07 15:10:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-07 15:10:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-07 15:10:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 15:10:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 15:10:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-07 15:10:05,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 15:10:05,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 15:10:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-07 15:10:05,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-07 15:10:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-07 15:10:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-07 15:10:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-07 15:10:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-07 15:10:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-07 15:10:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-07 15:10:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-07 15:10:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-07 15:10:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-07 15:10:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-07 15:10:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-07 15:10:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-07 15:10:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-07 15:10:05,404 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-07 15:10:05,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-07 15:10:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-07 15:10:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-07 15:10:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-07 15:10:05,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-07 15:10:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-07 15:10:05,409 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-07 15:10:05,410 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-07 15:10:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-07 15:10:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-07 15:10:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:10:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 15:10:05,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:10:10,484 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:10:10,486 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 15:10:10,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:10:10 BoogieIcfgContainer [2019-10-07 15:10:10,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:10:10,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:10:10,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:10:10,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:10:10,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:10:03" (1/3) ... [2019-10-07 15:10:10,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953b471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:10:10, skipping insertion in model container [2019-10-07 15:10:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:10:04" (2/3) ... [2019-10-07 15:10:10,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6953b471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:10:10, skipping insertion in model container [2019-10-07 15:10:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:10:10" (3/3) ... [2019-10-07 15:10:10,499 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_productSimulator.cil.c [2019-10-07 15:10:10,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:10:10,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:10:10,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:10:10,576 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:10:10,576 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:10:10,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:10:10,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:10:10,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:10:10,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:10:10,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:10:10,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:10:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states. [2019-10-07 15:10:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 15:10:10,642 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:10,643 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] [2019-10-07 15:10:10,645 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash 304259202, now seen corresponding path program 1 times [2019-10-07 15:10:10,661 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:10,661 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:10,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:10,662 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:11,468 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 15:10:11,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:11,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:11,470 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 15:10:11,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 15:10:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 15:10:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 15:10:11,492 INFO L87 Difference]: Start difference. First operand 610 states. Second operand 6 states. [2019-10-07 15:10:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:11,743 INFO L93 Difference]: Finished difference Result 1142 states and 1432 transitions. [2019-10-07 15:10:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 15:10:11,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-07 15:10:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:11,794 INFO L225 Difference]: With dead ends: 1142 [2019-10-07 15:10:11,794 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 15:10:11,811 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 15:10:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 15:10:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-07 15:10:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-07 15:10:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 718 transitions. [2019-10-07 15:10:11,949 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 718 transitions. Word has length 140 [2019-10-07 15:10:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:11,951 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 718 transitions. [2019-10-07 15:10:11,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 15:10:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2019-10-07 15:10:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 15:10:11,958 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:11,958 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] [2019-10-07 15:10:11,958 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1833776125, now seen corresponding path program 1 times [2019-10-07 15:10:11,959 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:11,959 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:11,959 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:11,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:12,284 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 15:10:12,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:12,285 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:12,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:10:12,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:10:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:10:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:10:12,288 INFO L87 Difference]: Start difference. First operand 583 states and 718 transitions. Second operand 4 states. [2019-10-07 15:10:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:13,218 INFO L93 Difference]: Finished difference Result 1132 states and 1424 transitions. [2019-10-07 15:10:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:10:13,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-07 15:10:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:13,227 INFO L225 Difference]: With dead ends: 1132 [2019-10-07 15:10:13,227 INFO L226 Difference]: Without dead ends: 581 [2019-10-07 15:10:13,231 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:10:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-07 15:10:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2019-10-07 15:10:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-07 15:10:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 707 transitions. [2019-10-07 15:10:13,276 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 707 transitions. Word has length 146 [2019-10-07 15:10:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:13,277 INFO L462 AbstractCegarLoop]: Abstraction has 581 states and 707 transitions. [2019-10-07 15:10:13,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:10:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 707 transitions. [2019-10-07 15:10:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-07 15:10:13,285 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:13,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:10:13,286 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:13,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:13,286 INFO L82 PathProgramCache]: Analyzing trace with hash -945275553, now seen corresponding path program 1 times [2019-10-07 15:10:13,286 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:13,287 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:13,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:13,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:13,586 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 15:10:13,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:13,587 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:13,587 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:13,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:13,588 INFO L87 Difference]: Start difference. First operand 581 states and 707 transitions. Second operand 3 states. [2019-10-07 15:10:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:13,739 INFO L93 Difference]: Finished difference Result 1125 states and 1383 transitions. [2019-10-07 15:10:13,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:13,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-07 15:10:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:13,745 INFO L225 Difference]: With dead ends: 1125 [2019-10-07 15:10:13,745 INFO L226 Difference]: Without dead ends: 580 [2019-10-07 15:10:13,748 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:10:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-07 15:10:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-07 15:10:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-07 15:10:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 703 transitions. [2019-10-07 15:10:13,799 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 703 transitions. Word has length 159 [2019-10-07 15:10:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:13,800 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 703 transitions. [2019-10-07 15:10:13,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 703 transitions. [2019-10-07 15:10:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-07 15:10:13,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:13,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:10:13,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:13,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1153514979, now seen corresponding path program 1 times [2019-10-07 15:10:13,805 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:13,805 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:13,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:13,805 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:13,966 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 15:10:13,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:13,967 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:13,967 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:10:13,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:10:13,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:10:13,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:10:13,968 INFO L87 Difference]: Start difference. First operand 580 states and 703 transitions. Second operand 4 states. [2019-10-07 15:10:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:14,896 INFO L93 Difference]: Finished difference Result 1097 states and 1330 transitions. [2019-10-07 15:10:14,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:10:14,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-07 15:10:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:14,903 INFO L225 Difference]: With dead ends: 1097 [2019-10-07 15:10:14,903 INFO L226 Difference]: Without dead ends: 577 [2019-10-07 15:10:14,906 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:10:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-07 15:10:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-07 15:10:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-07 15:10:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 686 transitions. [2019-10-07 15:10:14,956 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 686 transitions. Word has length 160 [2019-10-07 15:10:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:14,956 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 686 transitions. [2019-10-07 15:10:14,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:10:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 686 transitions. [2019-10-07 15:10:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-07 15:10:14,962 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:14,963 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 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, 1, 1, 1, 1, 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:10:14,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash -69801363, now seen corresponding path program 1 times [2019-10-07 15:10:14,964 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:14,964 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:14,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:14,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-07 15:10:15,233 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:15,233 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:15,233 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:15,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:15,236 INFO L87 Difference]: Start difference. First operand 577 states and 686 transitions. Second operand 3 states. [2019-10-07 15:10:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:15,274 INFO L93 Difference]: Finished difference Result 909 states and 1074 transitions. [2019-10-07 15:10:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:15,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-07 15:10:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:15,281 INFO L225 Difference]: With dead ends: 909 [2019-10-07 15:10:15,281 INFO L226 Difference]: Without dead ends: 579 [2019-10-07 15:10:15,283 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:10:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-07 15:10:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-07 15:10:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 15:10:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 688 transitions. [2019-10-07 15:10:15,316 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 688 transitions. Word has length 181 [2019-10-07 15:10:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:15,317 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 688 transitions. [2019-10-07 15:10:15,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 688 transitions. [2019-10-07 15:10:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-07 15:10:15,320 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:15,321 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, 1, 1, 1] [2019-10-07 15:10:15,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1101949612, now seen corresponding path program 1 times [2019-10-07 15:10:15,323 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:15,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:15,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:15,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-07 15:10:15,520 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:15,520 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:15,521 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:15,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:15,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:15,522 INFO L87 Difference]: Start difference. First operand 579 states and 688 transitions. Second operand 3 states. [2019-10-07 15:10:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:15,570 INFO L93 Difference]: Finished difference Result 1106 states and 1345 transitions. [2019-10-07 15:10:15,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:15,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-07 15:10:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:15,577 INFO L225 Difference]: With dead ends: 1106 [2019-10-07 15:10:15,577 INFO L226 Difference]: Without dead ends: 633 [2019-10-07 15:10:15,579 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:10:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-07 15:10:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 632. [2019-10-07 15:10:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-07 15:10:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 775 transitions. [2019-10-07 15:10:15,613 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 775 transitions. Word has length 188 [2019-10-07 15:10:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:15,614 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 775 transitions. [2019-10-07 15:10:15,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 775 transitions. [2019-10-07 15:10:15,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-07 15:10:15,618 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:15,618 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, 1, 1, 1, 1] [2019-10-07 15:10:15,619 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:15,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:15,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1968875577, now seen corresponding path program 1 times [2019-10-07 15:10:15,619 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:15,619 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:15,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:15,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:15,910 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 15:10:15,911 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:15,911 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:15,911 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:15,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:15,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:15,914 INFO L87 Difference]: Start difference. First operand 632 states and 775 transitions. Second operand 3 states. [2019-10-07 15:10:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:15,973 INFO L93 Difference]: Finished difference Result 1042 states and 1270 transitions. [2019-10-07 15:10:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:15,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-07 15:10:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:15,981 INFO L225 Difference]: With dead ends: 1042 [2019-10-07 15:10:15,981 INFO L226 Difference]: Without dead ends: 724 [2019-10-07 15:10:15,984 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:10:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-07 15:10:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 723. [2019-10-07 15:10:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-07 15:10:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 880 transitions. [2019-10-07 15:10:16,045 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 880 transitions. Word has length 189 [2019-10-07 15:10:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:16,048 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 880 transitions. [2019-10-07 15:10:16,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 880 transitions. [2019-10-07 15:10:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-07 15:10:16,057 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:16,057 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1345276914, now seen corresponding path program 1 times [2019-10-07 15:10:16,059 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:16,059 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:16,059 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:16,060 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:16,589 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:16,589 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:16,590 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-07 15:10:16,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 15:10:16,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 15:10:16,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-07 15:10:16,591 INFO L87 Difference]: Start difference. First operand 723 states and 880 transitions. Second operand 16 states. [2019-10-07 15:10:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:23,221 INFO L93 Difference]: Finished difference Result 1722 states and 2087 transitions. [2019-10-07 15:10:23,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 15:10:23,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 304 [2019-10-07 15:10:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:23,230 INFO L225 Difference]: With dead ends: 1722 [2019-10-07 15:10:23,230 INFO L226 Difference]: Without dead ends: 1347 [2019-10-07 15:10:23,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2019-10-07 15:10:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-10-07 15:10:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1336. [2019-10-07 15:10:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-10-07 15:10:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1638 transitions. [2019-10-07 15:10:23,326 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1638 transitions. Word has length 304 [2019-10-07 15:10:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:23,330 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 1638 transitions. [2019-10-07 15:10:23,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 15:10:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1638 transitions. [2019-10-07 15:10:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-07 15:10:23,338 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:23,339 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:23,339 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1695799518, now seen corresponding path program 1 times [2019-10-07 15:10:23,340 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:23,340 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:23,340 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:23,340 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-07 15:10:23,586 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:23,587 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:23,587 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:23,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:23,591 INFO L87 Difference]: Start difference. First operand 1336 states and 1638 transitions. Second operand 3 states. [2019-10-07 15:10:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:23,771 INFO L93 Difference]: Finished difference Result 3803 states and 4784 transitions. [2019-10-07 15:10:23,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:23,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-07 15:10:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:23,790 INFO L225 Difference]: With dead ends: 3803 [2019-10-07 15:10:23,791 INFO L226 Difference]: Without dead ends: 2508 [2019-10-07 15:10:23,798 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:10:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-10-07 15:10:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2505. [2019-10-07 15:10:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-10-07 15:10:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3120 transitions. [2019-10-07 15:10:23,998 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3120 transitions. Word has length 315 [2019-10-07 15:10:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:23,999 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 3120 transitions. [2019-10-07 15:10:23,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3120 transitions. [2019-10-07 15:10:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-07 15:10:24,012 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:24,013 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1544339518, now seen corresponding path program 1 times [2019-10-07 15:10:24,014 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:24,014 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:24,014 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:24,014 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-07 15:10:24,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:24,236 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:24,236 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:24,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:24,238 INFO L87 Difference]: Start difference. First operand 2505 states and 3120 transitions. Second operand 3 states. [2019-10-07 15:10:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:24,545 INFO L93 Difference]: Finished difference Result 6057 states and 7742 transitions. [2019-10-07 15:10:24,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:24,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-10-07 15:10:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:24,577 INFO L225 Difference]: With dead ends: 6057 [2019-10-07 15:10:24,578 INFO L226 Difference]: Without dead ends: 3596 [2019-10-07 15:10:24,591 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:10:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-10-07 15:10:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3593. [2019-10-07 15:10:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3593 states. [2019-10-07 15:10:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 4477 transitions. [2019-10-07 15:10:24,902 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 4477 transitions. Word has length 317 [2019-10-07 15:10:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:24,903 INFO L462 AbstractCegarLoop]: Abstraction has 3593 states and 4477 transitions. [2019-10-07 15:10:24,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 4477 transitions. [2019-10-07 15:10:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-07 15:10:24,921 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:24,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,922 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1981239029, now seen corresponding path program 1 times [2019-10-07 15:10:24,923 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:24,923 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:24,924 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:24,924 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-07 15:10:25,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:25,396 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:25,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 15:10:25,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:10:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:10:25,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 15:10:25,397 INFO L87 Difference]: Start difference. First operand 3593 states and 4477 transitions. Second operand 11 states. [2019-10-07 15:10:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:30,145 INFO L93 Difference]: Finished difference Result 6939 states and 8589 transitions. [2019-10-07 15:10:30,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 15:10:30,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 300 [2019-10-07 15:10:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:30,180 INFO L225 Difference]: With dead ends: 6939 [2019-10-07 15:10:30,180 INFO L226 Difference]: Without dead ends: 5100 [2019-10-07 15:10:30,189 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-10-07 15:10:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2019-10-07 15:10:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 5063. [2019-10-07 15:10:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5063 states. [2019-10-07 15:10:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 6312 transitions. [2019-10-07 15:10:30,568 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 6312 transitions. Word has length 300 [2019-10-07 15:10:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:30,570 INFO L462 AbstractCegarLoop]: Abstraction has 5063 states and 6312 transitions. [2019-10-07 15:10:30,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:10:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 6312 transitions. [2019-10-07 15:10:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-07 15:10:30,592 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:30,593 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,593 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash -397464041, now seen corresponding path program 1 times [2019-10-07 15:10:30,594 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:30,594 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:30,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:30,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:30,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:30,980 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:30,980 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:30,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:30,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:30,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:30,982 INFO L87 Difference]: Start difference. First operand 5063 states and 6312 transitions. Second operand 3 states. [2019-10-07 15:10:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:31,208 INFO L93 Difference]: Finished difference Result 10504 states and 13364 transitions. [2019-10-07 15:10:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:31,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-10-07 15:10:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:31,246 INFO L225 Difference]: With dead ends: 10504 [2019-10-07 15:10:31,247 INFO L226 Difference]: Without dead ends: 5675 [2019-10-07 15:10:31,264 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:10:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2019-10-07 15:10:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 5669. [2019-10-07 15:10:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5669 states. [2019-10-07 15:10:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7290 transitions. [2019-10-07 15:10:31,622 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7290 transitions. Word has length 325 [2019-10-07 15:10:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:31,623 INFO L462 AbstractCegarLoop]: Abstraction has 5669 states and 7290 transitions. [2019-10-07 15:10:31,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7290 transitions. [2019-10-07 15:10:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-07 15:10:31,653 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:31,653 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,654 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:31,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1163070922, now seen corresponding path program 1 times [2019-10-07 15:10:31,655 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:31,655 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:31,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:31,655 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:32,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:32,148 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:32,149 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:32,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:32,151 INFO L87 Difference]: Start difference. First operand 5669 states and 7290 transitions. Second operand 3 states. [2019-10-07 15:10:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:32,390 INFO L93 Difference]: Finished difference Result 12274 states and 16238 transitions. [2019-10-07 15:10:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:32,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-07 15:10:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:32,455 INFO L225 Difference]: With dead ends: 12274 [2019-10-07 15:10:32,455 INFO L226 Difference]: Without dead ends: 6839 [2019-10-07 15:10:32,477 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:10:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2019-10-07 15:10:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6833. [2019-10-07 15:10:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6833 states. [2019-10-07 15:10:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6833 states to 6833 states and 9174 transitions. [2019-10-07 15:10:32,933 INFO L78 Accepts]: Start accepts. Automaton has 6833 states and 9174 transitions. Word has length 326 [2019-10-07 15:10:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:32,934 INFO L462 AbstractCegarLoop]: Abstraction has 6833 states and 9174 transitions. [2019-10-07 15:10:32,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6833 states and 9174 transitions. [2019-10-07 15:10:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-07 15:10:32,966 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:32,968 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:32,969 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1024689187, now seen corresponding path program 1 times [2019-10-07 15:10:32,969 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:32,970 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:32,970 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:32,970 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:33,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:33,319 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:33,319 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:33,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:33,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:33,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:33,321 INFO L87 Difference]: Start difference. First operand 6833 states and 9174 transitions. Second operand 3 states. [2019-10-07 15:10:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:33,613 INFO L93 Difference]: Finished difference Result 15670 states and 21746 transitions. [2019-10-07 15:10:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:33,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-07 15:10:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:33,685 INFO L225 Difference]: With dead ends: 15670 [2019-10-07 15:10:33,685 INFO L226 Difference]: Without dead ends: 9071 [2019-10-07 15:10:33,709 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:10:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9071 states. [2019-10-07 15:10:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9071 to 9065. [2019-10-07 15:10:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9065 states. [2019-10-07 15:10:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9065 states to 9065 states and 12774 transitions. [2019-10-07 15:10:34,206 INFO L78 Accepts]: Start accepts. Automaton has 9065 states and 12774 transitions. Word has length 327 [2019-10-07 15:10:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:34,206 INFO L462 AbstractCegarLoop]: Abstraction has 9065 states and 12774 transitions. [2019-10-07 15:10:34,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 9065 states and 12774 transitions. [2019-10-07 15:10:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-10-07 15:10:34,247 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:34,248 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:34,249 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1957005424, now seen corresponding path program 1 times [2019-10-07 15:10:34,249 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:34,249 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:34,250 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:34,250 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:34,688 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:34,689 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:34,689 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:34,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:34,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:34,691 INFO L87 Difference]: Start difference. First operand 9065 states and 12774 transitions. Second operand 3 states. [2019-10-07 15:10:35,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:35,154 INFO L93 Difference]: Finished difference Result 22174 states and 32258 transitions. [2019-10-07 15:10:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:35,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-10-07 15:10:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:35,212 INFO L225 Difference]: With dead ends: 22174 [2019-10-07 15:10:35,212 INFO L226 Difference]: Without dead ends: 13343 [2019-10-07 15:10:35,245 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:10:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13343 states. [2019-10-07 15:10:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13343 to 13337. [2019-10-07 15:10:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13337 states. [2019-10-07 15:10:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13337 states to 13337 states and 19638 transitions. [2019-10-07 15:10:36,917 INFO L78 Accepts]: Start accepts. Automaton has 13337 states and 19638 transitions. Word has length 328 [2019-10-07 15:10:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:36,917 INFO L462 AbstractCegarLoop]: Abstraction has 13337 states and 19638 transitions. [2019-10-07 15:10:36,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 13337 states and 19638 transitions. [2019-10-07 15:10:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-07 15:10:36,985 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:36,985 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:36,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -280487517, now seen corresponding path program 1 times [2019-10-07 15:10:36,986 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:36,986 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:36,986 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:36,986 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:37,207 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:37,209 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:37,210 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:37,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:37,211 INFO L87 Difference]: Start difference. First operand 13337 states and 19638 transitions. Second operand 3 states. [2019-10-07 15:10:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:37,958 INFO L93 Difference]: Finished difference Result 34606 states and 52082 transitions. [2019-10-07 15:10:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:37,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-10-07 15:10:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:38,037 INFO L225 Difference]: With dead ends: 34606 [2019-10-07 15:10:38,037 INFO L226 Difference]: Without dead ends: 21503 [2019-10-07 15:10:38,071 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:10:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21503 states. [2019-10-07 15:10:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21503 to 21497. [2019-10-07 15:10:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21497 states. [2019-10-07 15:10:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21497 states to 21497 states and 32502 transitions. [2019-10-07 15:10:39,008 INFO L78 Accepts]: Start accepts. Automaton has 21497 states and 32502 transitions. Word has length 329 [2019-10-07 15:10:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:39,008 INFO L462 AbstractCegarLoop]: Abstraction has 21497 states and 32502 transitions. [2019-10-07 15:10:39,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 21497 states and 32502 transitions. [2019-10-07 15:10:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-10-07 15:10:39,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:39,091 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:39,091 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1010540202, now seen corresponding path program 1 times [2019-10-07 15:10:39,092 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:39,092 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:39,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:39,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:39,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:39,322 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:39,323 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:10:39,323 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:10:39,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:10:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:10:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:10:39,325 INFO L87 Difference]: Start difference. First operand 21497 states and 32502 transitions. Second operand 3 states. [2019-10-07 15:10:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:10:40,413 INFO L93 Difference]: Finished difference Result 58318 states and 89714 transitions. [2019-10-07 15:10:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:10:40,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-10-07 15:10:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:10:40,555 INFO L225 Difference]: With dead ends: 58318 [2019-10-07 15:10:40,556 INFO L226 Difference]: Without dead ends: 37055 [2019-10-07 15:10:40,616 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:10:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37055 states. [2019-10-07 15:10:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37055 to 37049. [2019-10-07 15:10:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37049 states. [2019-10-07 15:10:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37049 states to 37049 states and 57078 transitions. [2019-10-07 15:10:42,370 INFO L78 Accepts]: Start accepts. Automaton has 37049 states and 57078 transitions. Word has length 330 [2019-10-07 15:10:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:10:42,371 INFO L462 AbstractCegarLoop]: Abstraction has 37049 states and 57078 transitions. [2019-10-07 15:10:42,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:10:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37049 states and 57078 transitions. [2019-10-07 15:10:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-07 15:10:43,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:10:43,572 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:43,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:10:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:10:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2024433513, now seen corresponding path program 1 times [2019-10-07 15:10:43,573 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:10:43,573 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:43,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:43,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:10:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:10:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-07 15:10:44,199 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:10:44,199 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:10:44,200 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:10:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:10:45,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 4397 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:10:45,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:10:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-07 15:10:45,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:10:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-07 15:10:45,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:10:46,019 INFO L162 IcfgInterpreter]: Started Sifa with 265 locations of interest [2019-10-07 15:10:46,019 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:10:46,027 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:10:46,036 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:10:46,036 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:12:42,987 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 743 [2019-10-07 15:12:48,573 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 368 DAG size of output: 299 [2019-10-07 15:12:49,043 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 793 [2019-10-07 15:12:49,534 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 793 [2019-10-07 15:12:50,043 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 793 [2019-10-07 15:12:50,428 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2019-10-07 15:12:51,940 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:52,714 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:53,438 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:53,584 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2019-10-07 15:12:54,271 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:55,639 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 1101 DAG size of output: 1099 [2019-10-07 15:12:56,332 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:56,475 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2019-10-07 15:12:57,175 WARN L191 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:57,877 WARN L191 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:58,580 WARN L191 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:58,712 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2019-10-07 15:12:59,467 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 1099 [2019-10-07 15:12:59,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 589 for LOIs [2019-10-07 15:12:59,858 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 704 [2019-10-07 15:12:59,980 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 704 [2019-10-07 15:13:00,113 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 462 [2019-10-07 15:13:00,645 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 1010 [2019-10-07 15:13:00,646 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1169 for LOIs [2019-10-07 15:13:01,317 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 1169 [2019-10-07 15:13:01,993 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1169 [2019-10-07 15:13:02,296 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:03,525 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:04,213 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1169 [2019-10-07 15:13:04,879 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 1169 [2019-10-07 15:13:05,180 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:06,388 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:07,137 WARN L191 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:07,817 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:08,374 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:09,589 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:10,695 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 1417 DAG size of output: 1171 [2019-10-07 15:13:11,399 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:11,710 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:12,925 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:13,629 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:14,300 WARN L191 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:14,594 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:15,818 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:16,508 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:17,215 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:17,513 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:18,755 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:19,427 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:20,106 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:20,490 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:21,710 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:22,396 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:23,079 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:23,376 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:24,610 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:25,290 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:25,979 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:26,281 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:27,487 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:28,175 WARN L191 SmtUtils]: Spent 684.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:28,856 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:29,147 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:30,366 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:31,048 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:31,749 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:32,054 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:33,281 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:33,972 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:34,659 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:34,959 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:36,177 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:36,869 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:37,551 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1171 [2019-10-07 15:13:37,855 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 699 [2019-10-07 15:13:39,069 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1415 [2019-10-07 15:13:39,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:13:39,399 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:13:39,406 INFO L168 Benchmark]: Toolchain (without parser) took 215783.48 ms. Allocated memory was 137.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 97.7 MB in the beginning and 772.9 MB in the end (delta: -675.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,406 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1345.61 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 97.5 MB in the beginning and 105.2 MB in the end (delta: -7.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,410 INFO L168 Benchmark]: Boogie Preprocessor took 239.26 ms. Allocated memory is still 202.4 MB. Free memory was 105.2 MB in the beginning and 95.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,411 INFO L168 Benchmark]: RCFGBuilder took 5279.10 ms. Allocated memory was 202.4 MB in the beginning and 298.3 MB in the end (delta: 95.9 MB). Free memory was 94.7 MB in the beginning and 190.3 MB in the end (delta: -95.7 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,412 INFO L168 Benchmark]: TraceAbstraction took 208911.95 ms. Allocated memory was 298.3 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 190.3 MB in the beginning and 772.9 MB in the end (delta: -582.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-07 15:13:39,417 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1345.61 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 97.5 MB in the beginning and 105.2 MB in the end (delta: -7.6 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 239.26 ms. Allocated memory is still 202.4 MB. Free memory was 105.2 MB in the beginning and 95.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5279.10 ms. Allocated memory was 202.4 MB in the beginning and 298.3 MB in the end (delta: 95.9 MB). Free memory was 94.7 MB in the beginning and 190.3 MB in the end (delta: -95.7 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208911.95 ms. Allocated memory was 298.3 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 190.3 MB in the beginning and 772.9 MB in the end (delta: -582.5 MB). Peak memory consumption was 1.6 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...