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_spec27_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 14:50:38,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 14:50:38,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 14:50:38,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 14:50:38,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 14:50:38,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 14:50:38,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 14:50:38,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 14:50:38,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 14:50:38,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 14:50:38,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 14:50:38,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 14:50:38,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 14:50:38,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 14:50:38,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 14:50:38,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 14:50:38,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 14:50:38,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 14:50:38,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 14:50:38,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 14:50:38,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 14:50:38,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 14:50:38,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 14:50:38,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 14:50:38,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 14:50:38,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 14:50:38,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 14:50:38,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 14:50:38,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 14:50:38,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 14:50:38,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 14:50:38,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 14:50:38,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 14:50:38,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 14:50:38,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 14:50:38,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 14:50:38,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 14:50:38,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 14:50:38,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 14:50:38,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 14:50:38,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 14:50:38,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 14:50:38,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 14:50:38,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 14:50:38,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 14:50:38,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 14:50:38,220 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 14:50:38,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 14:50:38,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 14:50:38,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 14:50:38,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 14:50:38,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 14:50:38,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 14:50:38,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 14:50:38,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 14:50:38,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 14:50:38,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 14:50:38,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 14:50:38,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 14:50:38,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 14:50:38,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 14:50:38,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 14:50:38,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 14:50:38,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:50:38,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 14:50:38,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 14:50:38,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 14:50:38,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 14:50:38,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 14:50:38,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 14:50:38,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 14:50:38,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 14:50:38,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 14:50:38,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 14:50:38,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 14:50:38,531 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 14:50:38,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-07 14:50:38,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39db75e7/19c934a230414bb8ada15e02d6d3b30f/FLAG6c4cce720 [2019-10-07 14:50:39,285 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 14:50:39,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-07 14:50:39,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39db75e7/19c934a230414bb8ada15e02d6d3b30f/FLAG6c4cce720 [2019-10-07 14:50:39,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39db75e7/19c934a230414bb8ada15e02d6d3b30f [2019-10-07 14:50:39,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 14:50:39,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 14:50:39,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 14:50:39,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 14:50:39,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 14:50:39,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:50:39" (1/1) ... [2019-10-07 14:50:39,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e84451e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:39, skipping insertion in model container [2019-10-07 14:50:39,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:50:39" (1/1) ... [2019-10-07 14:50:39,482 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 14:50:39,547 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 14:50:40,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:50:40,403 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 14:50:40,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:50:40,661 INFO L192 MainTranslator]: Completed translation [2019-10-07 14:50:40,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40 WrapperNode [2019-10-07 14:50:40,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 14:50:40,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 14:50:40,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 14:50:40,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 14:50:40,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... [2019-10-07 14:50:40,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 14:50:40,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 14:50:40,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 14:50:40,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 14:50:40,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:50:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 14:50:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 14:50:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 14:50:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 14:50:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 14:50:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 14:50:40,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 14:50:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 14:50:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 14:50:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 14:50:40,934 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-07 14:50:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 14:50:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 14:50:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 14:50:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 14:50:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-07 14:50:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-07 14:50:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-07 14:50:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-07 14:50:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-07 14:50:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-07 14:50:40,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-07 14:50:40,938 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-07 14:50:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-07 14:50:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-07 14:50:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-07 14:50:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-07 14:50:40,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-07 14:50:40,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-07 14:50:40,941 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-07 14:50:40,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-07 14:50:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-07 14:50:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-07 14:50:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-07 14:50:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-07 14:50:40,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-07 14:50:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-07 14:50:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-07 14:50:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-07 14:50:40,945 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 14:50:40,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-07 14:50:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-07 14:50:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-07 14:50:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-07 14:50:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-07 14:50:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-07 14:50:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-07 14:50:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-07 14:50:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-07 14:50:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-07 14:50:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-07 14:50:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-07 14:50:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-07 14:50:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-07 14:50:40,950 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-07 14:50:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-07 14:50:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-07 14:50:40,951 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-07 14:50:40,952 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-07 14:50:40,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-07 14:50:40,953 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-07 14:50:40,954 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-07 14:50:40,954 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-07 14:50:40,954 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-07 14:50:40,955 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-07 14:50:40,956 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-07 14:50:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-07 14:50:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-07 14:50:40,957 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-07 14:50:40,958 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-07 14:50:40,959 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-07 14:50:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-07 14:50:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-07 14:50:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-07 14:50:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-07 14:50:40,960 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-07 14:50:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-07 14:50:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-07 14:50:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-07 14:50:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-07 14:50:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 14:50:40,962 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-07 14:50:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-07 14:50:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-07 14:50:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-07 14:50:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-07 14:50:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-07 14:50:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-07 14:50:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-07 14:50:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-07 14:50:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-07 14:50:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-07 14:50:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-07 14:50:40,989 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-07 14:50:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-07 14:50:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-07 14:50:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-07 14:50:40,990 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-07 14:50:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-07 14:50:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-07 14:50:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-07 14:50:40,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-07 14:50:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-07 14:50:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-07 14:50:40,995 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-07 14:50:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 14:50:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 14:50:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 14:50:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 14:50:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 14:50:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 14:50:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 14:50:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 14:50:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 14:50:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 14:50:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-07 14:50:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 14:50:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 14:50:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 14:50:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 14:50:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-07 14:50:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-07 14:50:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-07 14:50:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-07 14:50:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-07 14:50:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-07 14:50:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-07 14:50:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-07 14:50:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-07 14:50:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-07 14:50:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-07 14:50:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-07 14:50:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-07 14:50:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-07 14:50:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-07 14:50:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-07 14:50:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-07 14:50:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-07 14:50:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-07 14:50:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-07 14:50:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-07 14:50:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-07 14:50:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-07 14:50:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-07 14:50:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-07 14:50:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-07 14:50:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 14:50:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 14:50:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-07 14:50:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-07 14:50:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-07 14:50:41,026 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-07 14:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-07 14:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-07 14:50:41,027 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-07 14:50:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 14:50:41,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 14:50:46,504 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 14:50:46,504 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 14:50:46,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:50:46 BoogieIcfgContainer [2019-10-07 14:50:46,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 14:50:46,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 14:50:46,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 14:50:46,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 14:50:46,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:50:39" (1/3) ... [2019-10-07 14:50:46,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f65675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:50:46, skipping insertion in model container [2019-10-07 14:50:46,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:50:40" (2/3) ... [2019-10-07 14:50:46,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f65675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:50:46, skipping insertion in model container [2019-10-07 14:50:46,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:50:46" (3/3) ... [2019-10-07 14:50:46,517 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2019-10-07 14:50:46,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 14:50:46,539 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 14:50:46,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 14:50:46,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 14:50:46,600 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 14:50:46,600 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 14:50:46,600 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 14:50:46,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 14:50:46,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 14:50:46,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 14:50:46,601 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 14:50:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states. [2019-10-07 14:50:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-07 14:50:46,662 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:46,663 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:46,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 362165673, now seen corresponding path program 1 times [2019-10-07 14:50:46,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:46,681 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:46,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:46,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:50:47,377 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:47,378 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:47,378 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:50:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:50:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:50:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:50:47,401 INFO L87 Difference]: Start difference. First operand 609 states. Second operand 6 states. [2019-10-07 14:50:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:47,660 INFO L93 Difference]: Finished difference Result 1140 states and 1446 transitions. [2019-10-07 14:50:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:50:47,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-07 14:50:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:47,702 INFO L225 Difference]: With dead ends: 1140 [2019-10-07 14:50:47,702 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 14:50:47,715 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:50:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 14:50:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-07 14:50:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-07 14:50:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 718 transitions. [2019-10-07 14:50:47,816 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 718 transitions. Word has length 168 [2019-10-07 14:50:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:47,818 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 718 transitions. [2019-10-07 14:50:47,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:50:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 718 transitions. [2019-10-07 14:50:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-07 14:50:47,827 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:47,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:47,828 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1035734531, now seen corresponding path program 1 times [2019-10-07 14:50:47,828 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:47,829 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:47,829 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:47,829 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:50:48,212 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:48,212 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:48,212 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:50:48,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:50:48,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:50:48,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:50:48,227 INFO L87 Difference]: Start difference. First operand 582 states and 718 transitions. Second operand 4 states. [2019-10-07 14:50:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:49,122 INFO L93 Difference]: Finished difference Result 1124 states and 1404 transitions. [2019-10-07 14:50:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:50:49,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-07 14:50:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:49,127 INFO L225 Difference]: With dead ends: 1124 [2019-10-07 14:50:49,127 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 14:50:49,130 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:50:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 14:50:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-07 14:50:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-07 14:50:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 712 transitions. [2019-10-07 14:50:49,178 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 712 transitions. Word has length 174 [2019-10-07 14:50:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:49,179 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 712 transitions. [2019-10-07 14:50:49,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:50:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 712 transitions. [2019-10-07 14:50:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-07 14:50:49,186 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:49,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:49,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash 726963590, now seen corresponding path program 1 times [2019-10-07 14:50:49,189 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:49,189 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:49,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:49,190 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:50:49,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:49,492 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:49,492 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:50:49,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:50:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:50:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:49,494 INFO L87 Difference]: Start difference. First operand 582 states and 712 transitions. Second operand 3 states. [2019-10-07 14:50:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:49,602 INFO L93 Difference]: Finished difference Result 1638 states and 2049 transitions. [2019-10-07 14:50:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:50:49,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-07 14:50:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:49,621 INFO L225 Difference]: With dead ends: 1638 [2019-10-07 14:50:49,621 INFO L226 Difference]: Without dead ends: 1096 [2019-10-07 14:50:49,623 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-10-07 14:50:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1093. [2019-10-07 14:50:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-10-07 14:50:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1354 transitions. [2019-10-07 14:50:49,709 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1354 transitions. Word has length 192 [2019-10-07 14:50:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:49,710 INFO L462 AbstractCegarLoop]: Abstraction has 1093 states and 1354 transitions. [2019-10-07 14:50:49,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:50:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1354 transitions. [2019-10-07 14:50:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-07 14:50:49,718 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:49,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:49,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:49,719 INFO L82 PathProgramCache]: Analyzing trace with hash -469325502, now seen corresponding path program 1 times [2019-10-07 14:50:49,719 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:49,719 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:49,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:49,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:50:49,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:49,856 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:49,856 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:50:49,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:50:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:50:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:49,857 INFO L87 Difference]: Start difference. First operand 1093 states and 1354 transitions. Second operand 3 states. [2019-10-07 14:50:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:49,997 INFO L93 Difference]: Finished difference Result 1096 states and 1356 transitions. [2019-10-07 14:50:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:50:49,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-07 14:50:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:50,002 INFO L225 Difference]: With dead ends: 1096 [2019-10-07 14:50:50,002 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 14:50:50,004 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 14:50:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-07 14:50:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-07 14:50:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 705 transitions. [2019-10-07 14:50:50,034 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 705 transitions. Word has length 193 [2019-10-07 14:50:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:50,034 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 705 transitions. [2019-10-07 14:50:50,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:50:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 705 transitions. [2019-10-07 14:50:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-07 14:50:50,038 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:50,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:50,039 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 740205475, now seen corresponding path program 1 times [2019-10-07 14:50:50,039 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:50,040 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:50,040 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:50,040 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 14:50:50,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:50,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:50,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:50:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:50:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:50:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:50:50,197 INFO L87 Difference]: Start difference. First operand 582 states and 705 transitions. Second operand 4 states. [2019-10-07 14:50:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:51,026 INFO L93 Difference]: Finished difference Result 1107 states and 1340 transitions. [2019-10-07 14:50:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:50:51,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-10-07 14:50:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:51,031 INFO L225 Difference]: With dead ends: 1107 [2019-10-07 14:50:51,031 INFO L226 Difference]: Without dead ends: 587 [2019-10-07 14:50:51,033 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:50:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-07 14:50:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 581. [2019-10-07 14:50:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-07 14:50:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 689 transitions. [2019-10-07 14:50:51,061 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 689 transitions. Word has length 205 [2019-10-07 14:50:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 581 states and 689 transitions. [2019-10-07 14:50:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:50:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 689 transitions. [2019-10-07 14:50:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-07 14:50:51,066 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:51,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:51,066 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1902396525, now seen corresponding path program 1 times [2019-10-07 14:50:51,067 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:51,067 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,067 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,068 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:51,241 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 14:50:51,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,242 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:51,242 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:50:51,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:50:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:50:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:51,243 INFO L87 Difference]: Start difference. First operand 581 states and 689 transitions. Second operand 3 states. [2019-10-07 14:50:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:51,278 INFO L93 Difference]: Finished difference Result 913 states and 1078 transitions. [2019-10-07 14:50:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:50:51,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-07 14:50:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:51,284 INFO L225 Difference]: With dead ends: 913 [2019-10-07 14:50:51,285 INFO L226 Difference]: Without dead ends: 583 [2019-10-07 14:50:51,286 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-07 14:50:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-07 14:50:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-07 14:50:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 691 transitions. [2019-10-07 14:50:51,316 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 691 transitions. Word has length 226 [2019-10-07 14:50:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:51,317 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 691 transitions. [2019-10-07 14:50:51,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:50:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 691 transitions. [2019-10-07 14:50:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-07 14:50:51,322 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:51,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:51,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -97797234, now seen corresponding path program 1 times [2019-10-07 14:50:51,323 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:51,323 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,323 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,324 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:51,571 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 14:50:51,571 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,571 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:51,571 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:50:51,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:50:51,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:50:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:51,574 INFO L87 Difference]: Start difference. First operand 583 states and 691 transitions. Second operand 3 states. [2019-10-07 14:50:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:51,639 INFO L93 Difference]: Finished difference Result 1110 states and 1349 transitions. [2019-10-07 14:50:51,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:50:51,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-07 14:50:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:51,645 INFO L225 Difference]: With dead ends: 1110 [2019-10-07 14:50:51,646 INFO L226 Difference]: Without dead ends: 637 [2019-10-07 14:50:51,651 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:50:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-07 14:50:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 636. [2019-10-07 14:50:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-07 14:50:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 778 transitions. [2019-10-07 14:50:51,697 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 778 transitions. Word has length 233 [2019-10-07 14:50:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:51,698 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 778 transitions. [2019-10-07 14:50:51,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:50:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 778 transitions. [2019-10-07 14:50:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-07 14:50:51,705 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:51,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:51,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1484283318, now seen corresponding path program 1 times [2019-10-07 14:50:51,706 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:51,707 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,707 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,707 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:50:51,963 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:51,963 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:51,963 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:50:51,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:50:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:50:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:50:51,965 INFO L87 Difference]: Start difference. First operand 636 states and 778 transitions. Second operand 9 states. [2019-10-07 14:50:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:50:52,289 INFO L93 Difference]: Finished difference Result 974 states and 1198 transitions. [2019-10-07 14:50:52,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:50:52,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 234 [2019-10-07 14:50:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:50:52,294 INFO L225 Difference]: With dead ends: 974 [2019-10-07 14:50:52,294 INFO L226 Difference]: Without dead ends: 656 [2019-10-07 14:50:52,296 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:50:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-10-07 14:50:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 640. [2019-10-07 14:50:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-07 14:50:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 783 transitions. [2019-10-07 14:50:52,328 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 783 transitions. Word has length 234 [2019-10-07 14:50:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:50:52,329 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 783 transitions. [2019-10-07 14:50:52,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:50:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 783 transitions. [2019-10-07 14:50:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-07 14:50:52,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:50:52,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:50:52,335 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:50:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:50:52,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1121745602, now seen corresponding path program 1 times [2019-10-07 14:50:52,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:50:52,336 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:52,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:52,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:50:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:50:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:50:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:50:53,484 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:50:53,484 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:50:53,484 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-10-07 14:50:53,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-07 14:50:53,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-07 14:50:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1377, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 14:50:53,486 INFO L87 Difference]: Start difference. First operand 640 states and 783 transitions. Second operand 39 states. [2019-10-07 14:51:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:51:20,890 INFO L93 Difference]: Finished difference Result 1395 states and 1716 transitions. [2019-10-07 14:51:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-07 14:51:20,890 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 239 [2019-10-07 14:51:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:51:20,898 INFO L225 Difference]: With dead ends: 1395 [2019-10-07 14:51:20,898 INFO L226 Difference]: Without dead ends: 1059 [2019-10-07 14:51:20,901 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=375, Invalid=5631, Unknown=0, NotChecked=0, Total=6006 [2019-10-07 14:51:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-10-07 14:51:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1050. [2019-10-07 14:51:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-10-07 14:51:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1289 transitions. [2019-10-07 14:51:20,953 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1289 transitions. Word has length 239 [2019-10-07 14:51:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:51:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1289 transitions. [2019-10-07 14:51:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-07 14:51:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1289 transitions. [2019-10-07 14:51:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-07 14:51:20,958 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:51:20,959 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:51:20,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:51:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:51:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -265602705, now seen corresponding path program 1 times [2019-10-07 14:51:20,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:51:20,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:20,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:20,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:51:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:51:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:51:21,223 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:21,224 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:51:21,224 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:51:21,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:51:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:51:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:51:21,225 INFO L87 Difference]: Start difference. First operand 1050 states and 1289 transitions. Second operand 3 states. [2019-10-07 14:51:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:51:21,332 INFO L93 Difference]: Finished difference Result 2652 states and 3311 transitions. [2019-10-07 14:51:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:51:21,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-07 14:51:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:51:21,344 INFO L225 Difference]: With dead ends: 2652 [2019-10-07 14:51:21,344 INFO L226 Difference]: Without dead ends: 1982 [2019-10-07 14:51:21,348 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:51:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-10-07 14:51:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1979. [2019-10-07 14:51:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-10-07 14:51:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2461 transitions. [2019-10-07 14:51:21,456 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2461 transitions. Word has length 246 [2019-10-07 14:51:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:51:21,457 INFO L462 AbstractCegarLoop]: Abstraction has 1979 states and 2461 transitions. [2019-10-07 14:51:21,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:51:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2461 transitions. [2019-10-07 14:51:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-07 14:51:21,466 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:51:21,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:51:21,467 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:51:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:51:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1874107730, now seen corresponding path program 1 times [2019-10-07 14:51:21,468 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:51:21,468 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:21,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:21,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:21,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:51:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:51:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:51:22,524 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:22,524 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:51:22,524 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-10-07 14:51:22,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-07 14:51:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-07 14:51:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 14:51:22,526 INFO L87 Difference]: Start difference. First operand 1979 states and 2461 transitions. Second operand 41 states. [2019-10-07 14:51:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:51:48,492 INFO L93 Difference]: Finished difference Result 2739 states and 3422 transitions. [2019-10-07 14:51:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-07 14:51:48,493 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 246 [2019-10-07 14:51:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:51:48,506 INFO L225 Difference]: With dead ends: 2739 [2019-10-07 14:51:48,507 INFO L226 Difference]: Without dead ends: 2112 [2019-10-07 14:51:48,512 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=6247, Unknown=0, NotChecked=0, Total=6642 [2019-10-07 14:51:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-10-07 14:51:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2097. [2019-10-07 14:51:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-10-07 14:51:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2637 transitions. [2019-10-07 14:51:48,692 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2637 transitions. Word has length 246 [2019-10-07 14:51:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:51:48,693 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 2637 transitions. [2019-10-07 14:51:48,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-07 14:51:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2637 transitions. [2019-10-07 14:51:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-07 14:51:48,699 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:51:48,699 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:51:48,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:51:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:51:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 295376059, now seen corresponding path program 1 times [2019-10-07 14:51:48,700 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:51:48,701 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:48,701 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:48,701 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:51:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:51:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-07 14:51:48,908 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:48,908 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:51:48,908 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:51:48,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:51:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:51:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:51:48,909 INFO L87 Difference]: Start difference. First operand 2097 states and 2637 transitions. Second operand 3 states. [2019-10-07 14:51:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:51:49,076 INFO L93 Difference]: Finished difference Result 5911 states and 7987 transitions. [2019-10-07 14:51:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:51:49,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-07 14:51:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:51:49,101 INFO L225 Difference]: With dead ends: 5911 [2019-10-07 14:51:49,101 INFO L226 Difference]: Without dead ends: 3854 [2019-10-07 14:51:49,112 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:51:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2019-10-07 14:51:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3851. [2019-10-07 14:51:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3851 states. [2019-10-07 14:51:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 4953 transitions. [2019-10-07 14:51:49,317 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 4953 transitions. Word has length 250 [2019-10-07 14:51:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:51:49,318 INFO L462 AbstractCegarLoop]: Abstraction has 3851 states and 4953 transitions. [2019-10-07 14:51:49,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:51:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 4953 transitions. [2019-10-07 14:51:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 14:51:49,325 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:51:49,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:51:49,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:51:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:51:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1923461060, now seen corresponding path program 1 times [2019-10-07 14:51:49,326 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:51:49,327 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:49,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:49,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:51:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:51:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:51:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:51:50,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:51:50,395 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:51:50,395 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-07 14:51:50,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-07 14:51:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-07 14:51:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 14:51:50,397 INFO L87 Difference]: Start difference. First operand 3851 states and 4953 transitions. Second operand 43 states. [2019-10-07 14:52:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:52:16,872 INFO L93 Difference]: Finished difference Result 4521 states and 5783 transitions. [2019-10-07 14:52:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 14:52:16,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 248 [2019-10-07 14:52:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:52:16,897 INFO L225 Difference]: With dead ends: 4521 [2019-10-07 14:52:16,897 INFO L226 Difference]: Without dead ends: 3907 [2019-10-07 14:52:16,904 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=415, Invalid=6895, Unknown=0, NotChecked=0, Total=7310 [2019-10-07 14:52:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2019-10-07 14:52:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3880. [2019-10-07 14:52:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3880 states. [2019-10-07 14:52:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 4988 transitions. [2019-10-07 14:52:17,093 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 4988 transitions. Word has length 248 [2019-10-07 14:52:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:52:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 3880 states and 4988 transitions. [2019-10-07 14:52:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-07 14:52:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 4988 transitions. [2019-10-07 14:52:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 14:52:17,106 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:52:17,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:52:17,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:52:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:52:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1777484093, now seen corresponding path program 1 times [2019-10-07 14:52:17,108 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:52:17,108 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:17,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:17,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:17,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:52:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:52:17,366 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 14:52:17,367 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:17,367 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:52:17,367 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:52:17,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:52:17,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:52:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:52:17,369 INFO L87 Difference]: Start difference. First operand 3880 states and 4988 transitions. Second operand 3 states. [2019-10-07 14:52:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:52:17,575 INFO L93 Difference]: Finished difference Result 10774 states and 15141 transitions. [2019-10-07 14:52:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:52:17,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-07 14:52:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:52:17,624 INFO L225 Difference]: With dead ends: 10774 [2019-10-07 14:52:17,624 INFO L226 Difference]: Without dead ends: 7214 [2019-10-07 14:52:17,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:52:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2019-10-07 14:52:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 7211. [2019-10-07 14:52:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-10-07 14:52:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 9856 transitions. [2019-10-07 14:52:18,030 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 9856 transitions. Word has length 248 [2019-10-07 14:52:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:52:18,030 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 9856 transitions. [2019-10-07 14:52:18,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:52:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 9856 transitions. [2019-10-07 14:52:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-07 14:52:18,044 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:52:18,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:52:18,045 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:52:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:52:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1152623137, now seen corresponding path program 1 times [2019-10-07 14:52:18,046 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:52:18,046 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:18,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:18,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:52:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:52:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:52:19,045 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:19,045 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:52:19,045 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2019-10-07 14:52:19,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-07 14:52:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-07 14:52:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 14:52:19,047 INFO L87 Difference]: Start difference. First operand 7211 states and 9856 transitions. Second operand 41 states. [2019-10-07 14:52:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:52:42,468 INFO L93 Difference]: Finished difference Result 8132 states and 10938 transitions. [2019-10-07 14:52:42,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-07 14:52:42,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 247 [2019-10-07 14:52:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:52:42,516 INFO L225 Difference]: With dead ends: 8132 [2019-10-07 14:52:42,516 INFO L226 Difference]: Without dead ends: 7284 [2019-10-07 14:52:42,526 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=395, Invalid=6247, Unknown=0, NotChecked=0, Total=6642 [2019-10-07 14:52:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2019-10-07 14:52:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 7233. [2019-10-07 14:52:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7233 states. [2019-10-07 14:52:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 9881 transitions. [2019-10-07 14:52:43,014 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 9881 transitions. Word has length 247 [2019-10-07 14:52:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:52:43,015 INFO L462 AbstractCegarLoop]: Abstraction has 7233 states and 9881 transitions. [2019-10-07 14:52:43,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-07 14:52:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 9881 transitions. [2019-10-07 14:52:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-07 14:52:43,028 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:52:43,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:52:43,028 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:52:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:52:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 687020137, now seen corresponding path program 1 times [2019-10-07 14:52:43,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:52:43,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:43,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:43,030 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:52:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:52:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:52:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:52:44,097 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:52:44,097 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:52:44,097 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-07 14:52:44,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-07 14:52:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-07 14:52:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 14:52:44,099 INFO L87 Difference]: Start difference. First operand 7233 states and 9881 transitions. Second operand 43 states. [2019-10-07 14:53:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:53:09,568 INFO L93 Difference]: Finished difference Result 8456 states and 11395 transitions. [2019-10-07 14:53:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 14:53:09,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 254 [2019-10-07 14:53:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:53:09,600 INFO L225 Difference]: With dead ends: 8456 [2019-10-07 14:53:09,600 INFO L226 Difference]: Without dead ends: 7306 [2019-10-07 14:53:09,610 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=415, Invalid=6895, Unknown=0, NotChecked=0, Total=7310 [2019-10-07 14:53:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-07 14:53:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7255. [2019-10-07 14:53:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7255 states. [2019-10-07 14:53:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7255 states to 7255 states and 9906 transitions. [2019-10-07 14:53:09,961 INFO L78 Accepts]: Start accepts. Automaton has 7255 states and 9906 transitions. Word has length 254 [2019-10-07 14:53:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:53:09,962 INFO L462 AbstractCegarLoop]: Abstraction has 7255 states and 9906 transitions. [2019-10-07 14:53:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-07 14:53:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7255 states and 9906 transitions. [2019-10-07 14:53:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-07 14:53:09,975 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:53:09,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:53:09,976 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:53:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:53:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1897350353, now seen corresponding path program 1 times [2019-10-07 14:53:09,976 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:53:09,977 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:53:09,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:53:09,977 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:53:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:53:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:53:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:53:11,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:53:11,103 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:53:11,103 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-07 14:53:11,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-07 14:53:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-07 14:53:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2019-10-07 14:53:11,105 INFO L87 Difference]: Start difference. First operand 7255 states and 9906 transitions. Second operand 43 states. [2019-10-07 14:53:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:53:37,616 INFO L93 Difference]: Finished difference Result 8225 states and 11051 transitions. [2019-10-07 14:53:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 14:53:37,617 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2019-10-07 14:53:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:53:37,648 INFO L225 Difference]: With dead ends: 8225 [2019-10-07 14:53:37,648 INFO L226 Difference]: Without dead ends: 7370 [2019-10-07 14:53:37,657 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=415, Invalid=6895, Unknown=0, NotChecked=0, Total=7310 [2019-10-07 14:53:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2019-10-07 14:53:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 7319. [2019-10-07 14:53:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7319 states. [2019-10-07 14:53:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7319 states to 7319 states and 9983 transitions. [2019-10-07 14:53:38,115 INFO L78 Accepts]: Start accepts. Automaton has 7319 states and 9983 transitions. Word has length 249 [2019-10-07 14:53:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:53:38,115 INFO L462 AbstractCegarLoop]: Abstraction has 7319 states and 9983 transitions. [2019-10-07 14:53:38,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-07 14:53:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7319 states and 9983 transitions. [2019-10-07 14:53:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-07 14:53:38,128 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:53:38,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:53:38,129 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:53:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:53:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1629732727, now seen corresponding path program 1 times [2019-10-07 14:53:38,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:53:38,129 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:53:38,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:53:38,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:53:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:53:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:53:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-07 14:53:39,287 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:53:39,287 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:53:39,287 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2019-10-07 14:53:39,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-07 14:53:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-07 14:53:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1857, Unknown=0, NotChecked=0, Total=1980 [2019-10-07 14:53:39,289 INFO L87 Difference]: Start difference. First operand 7319 states and 9983 transitions. Second operand 45 states. [2019-10-07 14:54:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:54:09,187 INFO L93 Difference]: Finished difference Result 8564 states and 11523 transitions. [2019-10-07 14:54:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 14:54:09,188 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 256 [2019-10-07 14:54:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:54:09,217 INFO L225 Difference]: With dead ends: 8564 [2019-10-07 14:54:09,217 INFO L226 Difference]: Without dead ends: 7392 [2019-10-07 14:54:09,226 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=435, Invalid=7575, Unknown=0, NotChecked=0, Total=8010 [2019-10-07 14:54:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7392 states. [2019-10-07 14:54:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7392 to 7341. [2019-10-07 14:54:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7341 states. [2019-10-07 14:54:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10008 transitions. [2019-10-07 14:54:09,578 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10008 transitions. Word has length 256 [2019-10-07 14:54:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:54:09,579 INFO L462 AbstractCegarLoop]: Abstraction has 7341 states and 10008 transitions. [2019-10-07 14:54:09,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-07 14:54:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10008 transitions. [2019-10-07 14:54:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 14:54:09,592 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:54:09,593 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:54:09,593 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:54:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:54:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash -663172724, now seen corresponding path program 1 times [2019-10-07 14:54:09,594 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:54:09,594 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:09,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:09,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:54:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:54:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:54:09,735 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:09,735 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:54:09,735 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:54:09,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:54:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:54:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:54:09,737 INFO L87 Difference]: Start difference. First operand 7341 states and 10008 transitions. Second operand 3 states. [2019-10-07 14:54:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:54:09,982 INFO L93 Difference]: Finished difference Result 9284 states and 12426 transitions. [2019-10-07 14:54:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:54:09,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-07 14:54:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:54:10,002 INFO L225 Difference]: With dead ends: 9284 [2019-10-07 14:54:10,003 INFO L226 Difference]: Without dead ends: 5507 [2019-10-07 14:54:10,017 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:54:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5507 states. [2019-10-07 14:54:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5507 to 5504. [2019-10-07 14:54:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5504 states. [2019-10-07 14:54:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 6976 transitions. [2019-10-07 14:54:10,406 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 6976 transitions. Word has length 248 [2019-10-07 14:54:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:54:10,407 INFO L462 AbstractCegarLoop]: Abstraction has 5504 states and 6976 transitions. [2019-10-07 14:54:10,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:54:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 6976 transitions. [2019-10-07 14:54:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-07 14:54:10,417 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:54:10,417 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:54:10,418 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:54:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:54:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1420077443, now seen corresponding path program 1 times [2019-10-07 14:54:10,419 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:54:10,419 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:10,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:10,419 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:54:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:54:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-07 14:54:10,566 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:10,566 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:54:10,566 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:54:10,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:54:10,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:54:10,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:54:10,567 INFO L87 Difference]: Start difference. First operand 5504 states and 6976 transitions. Second operand 3 states. [2019-10-07 14:54:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:54:10,728 INFO L93 Difference]: Finished difference Result 5510 states and 6980 transitions. [2019-10-07 14:54:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:54:10,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-07 14:54:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:54:10,740 INFO L225 Difference]: With dead ends: 5510 [2019-10-07 14:54:10,740 INFO L226 Difference]: Without dead ends: 3784 [2019-10-07 14:54:10,746 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:54:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-07 14:54:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3781. [2019-10-07 14:54:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-07 14:54:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 4709 transitions. [2019-10-07 14:54:10,907 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 4709 transitions. Word has length 253 [2019-10-07 14:54:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:54:10,908 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 4709 transitions. [2019-10-07 14:54:10,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:54:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 4709 transitions. [2019-10-07 14:54:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-07 14:54:10,916 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:54:10,916 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:54:10,916 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:54:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:54:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash -838250679, now seen corresponding path program 1 times [2019-10-07 14:54:10,917 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:54:10,917 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:10,917 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:10,917 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:54:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:54:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-07 14:54:11,688 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:11,688 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:54:11,689 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-10-07 14:54:11,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-07 14:54:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-07 14:54:11,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2019-10-07 14:54:11,690 INFO L87 Difference]: Start difference. First operand 3781 states and 4709 transitions. Second operand 33 states. [2019-10-07 14:54:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:54:33,269 INFO L93 Difference]: Finished difference Result 7857 states and 9693 transitions. [2019-10-07 14:54:33,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-07 14:54:33,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 267 [2019-10-07 14:54:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:54:33,293 INFO L225 Difference]: With dead ends: 7857 [2019-10-07 14:54:33,293 INFO L226 Difference]: Without dead ends: 6448 [2019-10-07 14:54:33,300 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=333, Invalid=4223, Unknown=0, NotChecked=0, Total=4556 [2019-10-07 14:54:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2019-10-07 14:54:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 6369. [2019-10-07 14:54:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6369 states. [2019-10-07 14:54:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 7823 transitions. [2019-10-07 14:54:33,626 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 7823 transitions. Word has length 267 [2019-10-07 14:54:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:54:33,627 INFO L462 AbstractCegarLoop]: Abstraction has 6369 states and 7823 transitions. [2019-10-07 14:54:33,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-07 14:54:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 7823 transitions. [2019-10-07 14:54:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-07 14:54:33,636 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:54:33,637 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:54:33,637 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:54:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:54:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash 53462478, now seen corresponding path program 1 times [2019-10-07 14:54:33,637 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:54:33,638 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:33,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:33,638 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:54:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:54:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 14:54:34,558 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:34,558 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:54:34,558 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-07 14:54:34,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 14:54:34,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 14:54:34,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 14:54:34,559 INFO L87 Difference]: Start difference. First operand 6369 states and 7823 transitions. Second operand 38 states. [2019-10-07 14:54:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:54:51,219 INFO L93 Difference]: Finished difference Result 12035 states and 15120 transitions. [2019-10-07 14:54:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 14:54:51,221 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 261 [2019-10-07 14:54:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:54:51,251 INFO L225 Difference]: With dead ends: 12035 [2019-10-07 14:54:51,251 INFO L226 Difference]: Without dead ends: 9572 [2019-10-07 14:54:51,261 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=3919, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 14:54:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9572 states. [2019-10-07 14:54:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9572 to 9337. [2019-10-07 14:54:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9337 states. [2019-10-07 14:54:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9337 states to 9337 states and 11736 transitions. [2019-10-07 14:54:51,691 INFO L78 Accepts]: Start accepts. Automaton has 9337 states and 11736 transitions. Word has length 261 [2019-10-07 14:54:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:54:51,692 INFO L462 AbstractCegarLoop]: Abstraction has 9337 states and 11736 transitions. [2019-10-07 14:54:51,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 14:54:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 9337 states and 11736 transitions. [2019-10-07 14:54:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-07 14:54:51,707 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:54:51,707 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:54:51,707 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:54:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:54:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2031244442, now seen corresponding path program 1 times [2019-10-07 14:54:51,708 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:54:51,708 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:51,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:51,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:54:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:54:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:54:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 14:54:52,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:54:52,711 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:54:52,711 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-07 14:54:52,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 14:54:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 14:54:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1457, Unknown=0, NotChecked=0, Total=1560 [2019-10-07 14:54:52,712 INFO L87 Difference]: Start difference. First operand 9337 states and 11736 transitions. Second operand 40 states. [2019-10-07 14:55:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:55:10,489 INFO L93 Difference]: Finished difference Result 15327 states and 19680 transitions. [2019-10-07 14:55:10,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-07 14:55:10,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 268 [2019-10-07 14:55:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:55:10,529 INFO L225 Difference]: With dead ends: 15327 [2019-10-07 14:55:10,529 INFO L226 Difference]: Without dead ends: 10182 [2019-10-07 14:55:10,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=4304, Unknown=0, NotChecked=0, Total=4556 [2019-10-07 14:55:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2019-10-07 14:55:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 9927. [2019-10-07 14:55:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-10-07 14:55:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 12650 transitions. [2019-10-07 14:55:11,007 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 12650 transitions. Word has length 268 [2019-10-07 14:55:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:55:11,008 INFO L462 AbstractCegarLoop]: Abstraction has 9927 states and 12650 transitions. [2019-10-07 14:55:11,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 14:55:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 12650 transitions. [2019-10-07 14:55:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-07 14:55:11,016 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:55:11,016 INFO L385 BasicCegarLoop]: trace histogram [8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:55:11,017 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:55:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:55:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1774508912, now seen corresponding path program 1 times [2019-10-07 14:55:11,017 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:55:11,017 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:55:11,018 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:55:11,018 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:55:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:55:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:55:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 14:55:12,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:55:12,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:55:12,760 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 14:55:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:55:13,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 3718 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 14:55:13,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:55:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:55:13,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:55:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-07 14:55:14,064 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 14:55:14,098 INFO L162 IcfgInterpreter]: Started Sifa with 244 locations of interest [2019-10-07 14:55:14,099 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 14:55:14,106 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 14:55:14,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 14:55:14,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 14:56:35,881 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 707 [2019-10-07 14:56:40,851 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 349 DAG size of output: 283 [2019-10-07 14:56:41,253 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 758 [2019-10-07 14:56:41,586 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 758 [2019-10-07 14:56:41,848 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 758 [2019-10-07 14:56:42,013 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 14:56:42,746 WARN L191 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:43,412 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:44,140 WARN L191 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:44,277 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 14:56:44,912 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:46,206 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 1058 DAG size of output: 1056 [2019-10-07 14:56:46,827 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:46,965 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 14:56:47,677 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:48,296 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:48,913 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:49,034 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 14:56:49,743 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 1056 [2019-10-07 14:56:49,771 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 568 for LOIs [2019-10-07 14:56:50,108 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 671 [2019-10-07 14:56:50,215 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 671 [2019-10-07 14:56:50,338 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 450 [2019-10-07 14:56:50,792 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 969 [2019-10-07 14:56:50,794 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1126 for LOIs [2019-10-07 14:56:51,484 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1126 [2019-10-07 14:56:52,084 WARN L191 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 1126 [2019-10-07 14:56:52,378 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:56:53,566 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:56:54,183 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1126 [2019-10-07 14:56:54,786 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 1126 [2019-10-07 14:56:55,066 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:56:56,241 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:56:56,911 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:56:57,615 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:56:58,015 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:56:59,105 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:00,263 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 1370 DAG size of output: 1128 [2019-10-07 14:57:00,873 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:01,381 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 686 DAG size of output: 684 [2019-10-07 14:57:02,578 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:03,196 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:03,799 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:04,094 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:05,971 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:06,574 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:07,178 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:07,454 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:08,556 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:09,158 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:09,761 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:10,047 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:11,146 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:11,747 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:12,349 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:12,624 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:13,720 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:14,330 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:14,934 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:15,208 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:16,343 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:16,945 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:17,548 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:17,820 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:18,922 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:19,530 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:20,138 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:20,414 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:21,553 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:22,161 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:22,764 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:23,044 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:24,139 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:24,751 WARN L191 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:25,359 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 1128 [2019-10-07 14:57:25,636 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 684 [2019-10-07 14:57:26,742 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1368 [2019-10-07 14:57:27,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:57:27,092 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 14:57:27,106 INFO L168 Benchmark]: Toolchain (without parser) took 407633.81 ms. Allocated memory was 143.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 98.5 MB in the beginning and 652.0 MB in the end (delta: -553.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,106 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1195.09 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 98.2 MB in the beginning and 107.3 MB in the end (delta: -9.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,113 INFO L168 Benchmark]: Boogie Preprocessor took 189.89 ms. Allocated memory is still 202.9 MB. Free memory was 107.3 MB in the beginning and 97.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,115 INFO L168 Benchmark]: RCFGBuilder took 5653.54 ms. Allocated memory was 202.9 MB in the beginning and 308.8 MB in the end (delta: 105.9 MB). Free memory was 97.0 MB in the beginning and 231.7 MB in the end (delta: -134.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,116 INFO L168 Benchmark]: TraceAbstraction took 400590.02 ms. Allocated memory was 308.8 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 231.7 MB in the beginning and 652.0 MB in the end (delta: -420.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-07 14:57:27,126 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.20 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1195.09 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 98.2 MB in the beginning and 107.3 MB in the end (delta: -9.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.89 ms. Allocated memory is still 202.9 MB. Free memory was 107.3 MB in the beginning and 97.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5653.54 ms. Allocated memory was 202.9 MB in the beginning and 308.8 MB in the end (delta: 105.9 MB). Free memory was 97.0 MB in the beginning and 231.7 MB in the end (delta: -134.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 400590.02 ms. Allocated memory was 308.8 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 231.7 MB in the beginning and 652.0 MB in the end (delta: -420.3 MB). Peak memory consumption was 2.0 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...