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_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:11:24,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:11:24,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:11:24,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:11:24,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:11:24,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:11:24,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:11:24,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:11:24,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:11:24,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:11:24,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:11:24,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:11:24,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:11:24,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:11:24,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:11:24,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:11:24,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:11:24,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:11:24,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:11:24,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:11:24,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:11:24,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:11:24,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:11:24,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:11:24,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:11:24,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:11:24,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:11:24,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:11:24,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:11:24,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:11:24,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:11:24,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:11:24,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:11:24,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:11:24,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:11:24,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:11:24,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:11:24,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:11:24,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:11:24,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:11:24,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:11:24,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 15:11:24,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:11:24,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:11:24,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:11:24,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:11:24,353 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:11:24,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:11:24,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:11:24,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:11:24,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:11:24,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:11:24,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:11:24,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:11:24,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:11:24,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:11:24,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:11:24,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:11:24,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:11:24,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:11:24,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:11:24,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:11:24,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:11:24,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:11:24,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:11:24,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:11:24,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:11:24,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:11:24,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:11:24,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:11:24,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:11:24,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:11:24,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:11:24,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:11:24,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:11:24,675 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:11:24,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product26.cil.c [2019-10-07 15:11:24,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6d36df3/9e7219743f9142ce826ea90be145fff2/FLAG37ca6f720 [2019-10-07 15:11:25,419 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:11:25,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product26.cil.c [2019-10-07 15:11:25,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6d36df3/9e7219743f9142ce826ea90be145fff2/FLAG37ca6f720 [2019-10-07 15:11:25,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b6d36df3/9e7219743f9142ce826ea90be145fff2 [2019-10-07 15:11:25,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:11:25,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:11:25,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:11:25,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:11:25,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:11:25,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:11:25" (1/1) ... [2019-10-07 15:11:25,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21180631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:25, skipping insertion in model container [2019-10-07 15:11:25,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:11:25" (1/1) ... [2019-10-07 15:11:25,607 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:11:25,700 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:11:26,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:11:26,408 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:11:26,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:11:26,633 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:11:26,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26 WrapperNode [2019-10-07 15:11:26,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:11:26,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:11:26,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:11:26,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:11:26,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... [2019-10-07 15:11:26,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:11:26,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:11:26,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:11:26,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:11:26,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:11:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:11:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:11:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 15:11:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 15:11:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 15:11:26,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 15:11:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 15:11:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 15:11:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 15:11:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-07 15:11:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-07 15:11:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-07 15:11:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-07 15:11:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-07 15:11:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-07 15:11:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-07 15:11:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-07 15:11:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-07 15:11:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-07 15:11:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-07 15:11:26,916 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-07 15:11:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-07 15:11:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-07 15:11:26,919 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-07 15:11:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-07 15:11:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-07 15:11:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-07 15:11:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-07 15:11:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-07 15:11:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-07 15:11:26,926 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-07 15:11:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-07 15:11:26,928 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-07 15:11:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-07 15:11:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-07 15:11:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-07 15:11:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-07 15:11:26,929 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-07 15:11:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 15:11:26,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 15:11:26,931 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 15:11:26,932 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-07 15:11:26,933 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-07 15:11:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-07 15:11:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-07 15:11:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-07 15:11:26,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-07 15:11:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-07 15:11:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-07 15:11:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 15:11:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-07 15:11:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-07 15:11:26,939 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-07 15:11:26,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-07 15:11:26,941 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-07 15:11:26,942 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-07 15:11:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-07 15:11:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-07 15:11:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-07 15:11:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-07 15:11:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-07 15:11:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-07 15:11:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-07 15:11:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-07 15:11:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-07 15:11:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-07 15:11:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-07 15:11:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-07 15:11:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-07 15:11:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-07 15:11:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-07 15:11:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-07 15:11:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-07 15:11:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-07 15:11:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-07 15:11:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-07 15:11:26,951 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-07 15:11:26,952 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:11:26,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 15:11:26,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:11:31,717 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:11:31,718 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 15:11:31,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:11:31 BoogieIcfgContainer [2019-10-07 15:11:31,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:11:31,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:11:31,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:11:31,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:11:31,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:11:25" (1/3) ... [2019-10-07 15:11:31,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3b1b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:11:31, skipping insertion in model container [2019-10-07 15:11:31,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:11:26" (2/3) ... [2019-10-07 15:11:31,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3b1b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:11:31, skipping insertion in model container [2019-10-07 15:11:31,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:11:31" (3/3) ... [2019-10-07 15:11:31,734 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product26.cil.c [2019-10-07 15:11:31,750 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:11:31,765 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:11:31,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:11:31,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:11:31,934 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:11:31,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:11:31,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:11:31,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:11:31,935 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:11:31,935 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:11:31,935 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:11:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states. [2019-10-07 15:11:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 15:11:32,015 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:32,016 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 15:11:32,019 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2007486757, now seen corresponding path program 1 times [2019-10-07 15:11:32,035 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:32,035 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:32,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:32,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 15:11:32,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:32,671 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:32,672 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 15:11:32,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 15:11:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 15:11:32,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 15:11:32,696 INFO L87 Difference]: Start difference. First operand 420 states. Second operand 2 states. [2019-10-07 15:11:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:32,769 INFO L93 Difference]: Finished difference Result 615 states and 732 transitions. [2019-10-07 15:11:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 15:11:32,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 121 [2019-10-07 15:11:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:32,790 INFO L225 Difference]: With dead ends: 615 [2019-10-07 15:11:32,790 INFO L226 Difference]: Without dead ends: 393 [2019-10-07 15:11:32,797 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 15:11:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-07 15:11:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-10-07 15:11:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 15:11:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 464 transitions. [2019-10-07 15:11:32,893 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 464 transitions. Word has length 121 [2019-10-07 15:11:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:32,896 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 464 transitions. [2019-10-07 15:11:32,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 15:11:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 464 transitions. [2019-10-07 15:11:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 15:11:32,900 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:32,901 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 15:11:32,901 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1428415782, now seen corresponding path program 1 times [2019-10-07 15:11:32,902 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:32,902 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:32,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:32,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 15:11:33,100 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,100 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:33,100 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:33,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,108 INFO L87 Difference]: Start difference. First operand 393 states and 464 transitions. Second operand 3 states. [2019-10-07 15:11:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:33,178 INFO L93 Difference]: Finished difference Result 600 states and 701 transitions. [2019-10-07 15:11:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:33,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-07 15:11:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:33,185 INFO L225 Difference]: With dead ends: 600 [2019-10-07 15:11:33,185 INFO L226 Difference]: Without dead ends: 395 [2019-10-07 15:11:33,188 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-07 15:11:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-07 15:11:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-07 15:11:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2019-10-07 15:11:33,229 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 122 [2019-10-07 15:11:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:33,230 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2019-10-07 15:11:33,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2019-10-07 15:11:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-07 15:11:33,233 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:33,233 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 15:11:33,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2110274793, now seen corresponding path program 1 times [2019-10-07 15:11:33,234 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:33,234 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 15:11:33,524 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,524 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:33,525 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:33,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,528 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 3 states. [2019-10-07 15:11:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:33,578 INFO L93 Difference]: Finished difference Result 776 states and 945 transitions. [2019-10-07 15:11:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:33,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-07 15:11:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:33,583 INFO L225 Difference]: With dead ends: 776 [2019-10-07 15:11:33,583 INFO L226 Difference]: Without dead ends: 439 [2019-10-07 15:11:33,586 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-07 15:11:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 438. [2019-10-07 15:11:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-07 15:11:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 540 transitions. [2019-10-07 15:11:33,619 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 540 transitions. Word has length 134 [2019-10-07 15:11:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:33,620 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 540 transitions. [2019-10-07 15:11:33,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 540 transitions. [2019-10-07 15:11:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-07 15:11:33,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:33,623 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 15:11:33,623 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1667295687, now seen corresponding path program 1 times [2019-10-07 15:11:33,624 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:33,624 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,624 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 15:11:33,849 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,850 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:33,850 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:33,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:33,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,851 INFO L87 Difference]: Start difference. First operand 438 states and 540 transitions. Second operand 3 states. [2019-10-07 15:11:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:33,891 INFO L93 Difference]: Finished difference Result 695 states and 841 transitions. [2019-10-07 15:11:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-10-07 15:11:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:33,896 INFO L225 Difference]: With dead ends: 695 [2019-10-07 15:11:33,896 INFO L226 Difference]: Without dead ends: 502 [2019-10-07 15:11:33,898 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-07 15:11:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 501. [2019-10-07 15:11:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-07 15:11:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 613 transitions. [2019-10-07 15:11:33,933 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 613 transitions. Word has length 135 [2019-10-07 15:11:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:33,933 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 613 transitions. [2019-10-07 15:11:33,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 613 transitions. [2019-10-07 15:11:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-07 15:11:33,939 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:33,940 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:33,940 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 505031102, now seen corresponding path program 1 times [2019-10-07 15:11:33,941 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:33,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:33,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:34,343 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:34,343 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:34,343 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:11:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:11:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:11:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:11:34,345 INFO L87 Difference]: Start difference. First operand 501 states and 613 transitions. Second operand 12 states. [2019-10-07 15:11:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:36,954 INFO L93 Difference]: Finished difference Result 1173 states and 1424 transitions. [2019-10-07 15:11:36,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 15:11:36,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 236 [2019-10-07 15:11:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:36,963 INFO L225 Difference]: With dead ends: 1173 [2019-10-07 15:11:36,963 INFO L226 Difference]: Without dead ends: 922 [2019-10-07 15:11:36,966 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-10-07 15:11:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-07 15:11:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 913. [2019-10-07 15:11:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-07 15:11:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1126 transitions. [2019-10-07 15:11:37,042 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1126 transitions. Word has length 236 [2019-10-07 15:11:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:37,044 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1126 transitions. [2019-10-07 15:11:37,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:11:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1126 transitions. [2019-10-07 15:11:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-07 15:11:37,052 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:37,053 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:37,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1103444841, now seen corresponding path program 1 times [2019-10-07 15:11:37,054 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:37,054 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:37,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:37,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:37,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:37,273 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:37,273 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:37,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:37,274 INFO L87 Difference]: Start difference. First operand 913 states and 1126 transitions. Second operand 3 states. [2019-10-07 15:11:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:37,342 INFO L93 Difference]: Finished difference Result 1932 states and 2473 transitions. [2019-10-07 15:11:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:37,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-07 15:11:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:37,355 INFO L225 Difference]: With dead ends: 1932 [2019-10-07 15:11:37,356 INFO L226 Difference]: Without dead ends: 1077 [2019-10-07 15:11:37,360 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-10-07 15:11:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1075. [2019-10-07 15:11:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-10-07 15:11:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1404 transitions. [2019-10-07 15:11:37,457 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1404 transitions. Word has length 251 [2019-10-07 15:11:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:37,458 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 1404 transitions. [2019-10-07 15:11:37,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1404 transitions. [2019-10-07 15:11:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-07 15:11:37,467 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:37,467 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:37,468 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -351024519, now seen corresponding path program 1 times [2019-10-07 15:11:37,469 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:37,469 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:37,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:37,469 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:37,874 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:37,874 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:37,875 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:37,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:37,878 INFO L87 Difference]: Start difference. First operand 1075 states and 1404 transitions. Second operand 3 states. [2019-10-07 15:11:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:37,980 INFO L93 Difference]: Finished difference Result 2406 states and 3287 transitions. [2019-10-07 15:11:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:37,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-07 15:11:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:38,004 INFO L225 Difference]: With dead ends: 2406 [2019-10-07 15:11:38,004 INFO L226 Difference]: Without dead ends: 1389 [2019-10-07 15:11:38,010 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2019-10-07 15:11:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1387. [2019-10-07 15:11:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-07 15:11:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1936 transitions. [2019-10-07 15:11:38,134 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1936 transitions. Word has length 252 [2019-10-07 15:11:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:38,136 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 1936 transitions. [2019-10-07 15:11:38,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1936 transitions. [2019-10-07 15:11:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-07 15:11:38,149 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:38,150 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:38,150 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1639900407, now seen corresponding path program 1 times [2019-10-07 15:11:38,151 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:38,151 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:38,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:38,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:38,345 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:38,346 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:38,346 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:38,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:38,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:38,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:38,348 INFO L87 Difference]: Start difference. First operand 1387 states and 1936 transitions. Second operand 3 states. [2019-10-07 15:11:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:38,451 INFO L93 Difference]: Finished difference Result 3318 states and 4843 transitions. [2019-10-07 15:11:38,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:38,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-07 15:11:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:38,465 INFO L225 Difference]: With dead ends: 3318 [2019-10-07 15:11:38,465 INFO L226 Difference]: Without dead ends: 1989 [2019-10-07 15:11:38,471 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-10-07 15:11:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1987. [2019-10-07 15:11:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-10-07 15:11:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2952 transitions. [2019-10-07 15:11:38,594 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2952 transitions. Word has length 253 [2019-10-07 15:11:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:38,594 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2952 transitions. [2019-10-07 15:11:38,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2952 transitions. [2019-10-07 15:11:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-07 15:11:38,612 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:38,613 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:38,614 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1439854813, now seen corresponding path program 1 times [2019-10-07 15:11:38,615 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:38,615 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:38,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:38,615 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 15:11:39,034 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:39,035 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:39,035 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 15:11:39,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:11:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:11:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-07 15:11:39,037 INFO L87 Difference]: Start difference. First operand 1987 states and 2952 transitions. Second operand 11 states. [2019-10-07 15:11:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:42,987 INFO L93 Difference]: Finished difference Result 2732 states and 3822 transitions. [2019-10-07 15:11:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 15:11:42,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2019-10-07 15:11:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:43,003 INFO L225 Difference]: With dead ends: 2732 [2019-10-07 15:11:43,003 INFO L226 Difference]: Without dead ends: 2307 [2019-10-07 15:11:43,006 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-07 15:11:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-10-07 15:11:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2290. [2019-10-07 15:11:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-10-07 15:11:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3309 transitions. [2019-10-07 15:11:43,151 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3309 transitions. Word has length 238 [2019-10-07 15:11:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:43,152 INFO L462 AbstractCegarLoop]: Abstraction has 2290 states and 3309 transitions. [2019-10-07 15:11:43,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:11:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3309 transitions. [2019-10-07 15:11:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-07 15:11:43,170 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:43,171 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:43,171 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 135113433, now seen corresponding path program 1 times [2019-10-07 15:11:43,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:43,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:43,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:43,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:43,380 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:43,380 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:43,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:43,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:43,382 INFO L87 Difference]: Start difference. First operand 2290 states and 3309 transitions. Second operand 3 states. [2019-10-07 15:11:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:43,593 INFO L93 Difference]: Finished difference Result 5676 states and 8525 transitions. [2019-10-07 15:11:43,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:43,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-10-07 15:11:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:43,620 INFO L225 Difference]: With dead ends: 5676 [2019-10-07 15:11:43,620 INFO L226 Difference]: Without dead ends: 3444 [2019-10-07 15:11:43,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-10-07 15:11:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3442. [2019-10-07 15:11:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-10-07 15:11:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5245 transitions. [2019-10-07 15:11:44,045 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5245 transitions. Word has length 254 [2019-10-07 15:11:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:44,046 INFO L462 AbstractCegarLoop]: Abstraction has 3442 states and 5245 transitions. [2019-10-07 15:11:44,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5245 transitions. [2019-10-07 15:11:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-07 15:11:44,072 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:44,073 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:44,073 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1780480681, now seen corresponding path program 1 times [2019-10-07 15:11:44,074 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:44,075 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:44,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:44,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:44,283 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:44,283 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:44,283 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:44,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:44,284 INFO L87 Difference]: Start difference. First operand 3442 states and 5245 transitions. Second operand 3 states. [2019-10-07 15:11:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:44,514 INFO L93 Difference]: Finished difference Result 9036 states and 14173 transitions. [2019-10-07 15:11:44,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:44,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-07 15:11:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:44,560 INFO L225 Difference]: With dead ends: 9036 [2019-10-07 15:11:44,561 INFO L226 Difference]: Without dead ends: 5652 [2019-10-07 15:11:44,577 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-10-07 15:11:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-10-07 15:11:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-10-07 15:11:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8925 transitions. [2019-10-07 15:11:44,912 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8925 transitions. Word has length 255 [2019-10-07 15:11:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:44,914 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8925 transitions. [2019-10-07 15:11:44,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8925 transitions. [2019-10-07 15:11:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-07 15:11:44,945 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:44,945 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:44,945 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash 772246329, now seen corresponding path program 1 times [2019-10-07 15:11:44,946 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:44,946 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:44,946 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:44,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:45,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:45,193 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:11:45,193 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:11:45,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:11:45,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:11:45,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:45,194 INFO L87 Difference]: Start difference. First operand 5650 states and 8925 transitions. Second operand 3 states. [2019-10-07 15:11:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:11:45,628 INFO L93 Difference]: Finished difference Result 15468 states and 24893 transitions. [2019-10-07 15:11:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:11:45,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-10-07 15:11:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:11:45,717 INFO L225 Difference]: With dead ends: 15468 [2019-10-07 15:11:45,718 INFO L226 Difference]: Without dead ends: 9876 [2019-10-07 15:11:45,742 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:11:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9876 states. [2019-10-07 15:11:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9876 to 9874. [2019-10-07 15:11:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-10-07 15:11:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 15901 transitions. [2019-10-07 15:11:46,336 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 15901 transitions. Word has length 256 [2019-10-07 15:11:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:11:46,336 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 15901 transitions. [2019-10-07 15:11:46,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:11:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 15901 transitions. [2019-10-07 15:11:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 15:11:46,410 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:11:46,410 INFO L385 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:11:46,410 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:11:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:11:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1264854455, now seen corresponding path program 1 times [2019-10-07 15:11:46,411 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:11:46,411 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:46,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:46,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:11:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:11:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 15:11:47,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:11:47,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:11:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:11:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:11:48,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 3533 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:11:48,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:11:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-07 15:11:48,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:11:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 15:11:48,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:11:48,712 INFO L162 IcfgInterpreter]: Started Sifa with 208 locations of interest [2019-10-07 15:11:48,712 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:11:48,720 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:11:48,728 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:11:48,729 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:13:15,020 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 712 [2019-10-07 15:13:19,574 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 326 DAG size of output: 265 [2019-10-07 15:13:20,004 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:13:20,404 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:13:20,720 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:13:20,899 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:13:21,621 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:22,332 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:22,999 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:23,152 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:13:23,857 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:25,305 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 1059 DAG size of output: 1057 [2019-10-07 15:13:25,990 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:26,139 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:13:26,830 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:27,488 WARN L191 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:28,147 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:28,275 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:13:28,929 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:13:28,961 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 574 for LOIs [2019-10-07 15:13:29,390 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 676 [2019-10-07 15:13:29,511 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 676 [2019-10-07 15:13:29,670 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:13:30,162 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 978 [2019-10-07 15:13:30,164 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1115 for LOIs [2019-10-07 15:13:30,813 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:31,460 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:31,725 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:32,783 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:33,442 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:34,091 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:34,357 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:35,398 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:36,148 WARN L191 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:36,801 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:37,059 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:38,112 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:39,147 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1115 [2019-10-07 15:13:39,795 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:40,286 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 647 DAG size of output: 645 [2019-10-07 15:13:41,322 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:41,976 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:42,625 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:42,902 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:43,962 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:44,592 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:45,224 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:45,516 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:46,575 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:47,231 WARN L191 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:47,870 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:48,120 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:49,143 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:49,789 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:50,436 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:50,687 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:51,736 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:52,380 WARN L191 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:53,016 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:53,266 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:54,303 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:54,940 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:55,570 WARN L191 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:55,823 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:56,850 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:13:57,482 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:58,119 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:13:58,370 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:13:59,387 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:00,002 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:14:00,629 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:14:00,875 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:01,908 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:02,526 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:14:03,151 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:14:03,402 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:04,414 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:05,515 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:06,547 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:06,872 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:07,891 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:09,759 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:14:10,773 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:11,046 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:12,058 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:13,083 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:14,103 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:14,354 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:15,365 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:16,412 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:17,449 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:17,703 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:18,710 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:19,944 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:20,975 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:21,236 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:22,252 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:23,294 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:24,310 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:24,558 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:25,588 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:26,622 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1318 [2019-10-07 15:14:27,666 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1318 [2019-10-07 15:14:27,956 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:28,978 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1318 [2019-10-07 15:14:30,027 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1320 [2019-10-07 15:14:31,066 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 1320 [2019-10-07 15:14:31,327 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:32,383 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1320 [2019-10-07 15:14:34,674 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:14:35,683 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:35,944 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:36,973 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:38,836 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:14:39,860 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:40,124 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:41,128 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:42,154 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:43,188 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:43,441 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:44,469 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:46,325 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:14:47,349 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:47,609 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:48,634 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:50,486 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:14:51,488 WARN L191 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:51,748 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:52,747 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:53,766 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:54,779 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:55,022 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:14:56,021 WARN L191 SmtUtils]: Spent 997.00 ms on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:14:57,058 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:58,071 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:14:58,336 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:14:59,343 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:00,384 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:01,396 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:01,654 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:15:02,676 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:03,694 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:04,705 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:04,953 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:15:05,972 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:07,802 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 1320 DAG size of output: 1311 [2019-10-07 15:15:08,857 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:15:09,128 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:15:10,150 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:11,986 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 1322 DAG size of output: 1313 [2019-10-07 15:15:13,002 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:15:13,289 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:15:14,305 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 1315 [2019-10-07 15:15:14,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:15:14,575 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: ε 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: ε 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.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.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 15:15:14,582 INFO L168 Benchmark]: Toolchain (without parser) took 228995.44 ms. Allocated memory was 137.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 99.6 MB in the beginning and 362.2 MB in the end (delta: -262.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,583 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1047.48 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 132.9 MB in the end (delta: -33.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,584 INFO L168 Benchmark]: Boogie Preprocessor took 187.26 ms. Allocated memory is still 202.9 MB. Free memory was 132.9 MB in the beginning and 123.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,585 INFO L168 Benchmark]: RCFGBuilder took 4897.82 ms. Allocated memory was 202.9 MB in the beginning and 298.3 MB in the end (delta: 95.4 MB). Free memory was 123.7 MB in the beginning and 82.3 MB in the end (delta: 41.3 MB). Peak memory consumption was 136.8 MB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,585 INFO L168 Benchmark]: TraceAbstraction took 222857.10 ms. Allocated memory was 298.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 79.2 MB in the beginning and 362.2 MB in the end (delta: -283.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-07 15:15:14,588 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1047.48 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.4 MB in the beginning and 132.9 MB in the end (delta: -33.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 187.26 ms. Allocated memory is still 202.9 MB. Free memory was 132.9 MB in the beginning and 123.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4897.82 ms. Allocated memory was 202.9 MB in the beginning and 298.3 MB in the end (delta: 95.4 MB). Free memory was 123.7 MB in the beginning and 82.3 MB in the end (delta: 41.3 MB). Peak memory consumption was 136.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222857.10 ms. Allocated memory was 298.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 79.2 MB in the beginning and 362.2 MB in the end (delta: -283.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: 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...