java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:07:25,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:07:25,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:07:25,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:07:25,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:07:25,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:07:25,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:07:25,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:07:25,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:07:25,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:07:25,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:07:25,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:07:25,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:07:25,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:07:25,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:07:25,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:07:25,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:07:25,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:07:25,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:07:25,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:07:25,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:07:25,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:07:25,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:07:25,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:07:25,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:07:25,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:07:25,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:07:25,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:07:25,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:07:25,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:07:25,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:07:25,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:07:25,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:07:25,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:07:25,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:07:25,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:07:25,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:07:25,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:07:25,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:07:25,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:07:25,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:07:25,257 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:07:25,294 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:07:25,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:07:25,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:07:25,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:07:25,299 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:07:25,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:07:25,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:07:25,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:07:25,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:07:25,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:07:25,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:07:25,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:07:25,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:07:25,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:07:25,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:07:25,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:07:25,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:07:25,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:07:25,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:07:25,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:07:25,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:07:25,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:07:25,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:07:25,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:07:25,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:07:25,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:07:25,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:07:25,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:07:25,306 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:07:25,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:07:25,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:07:25,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:07:25,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:07:25,618 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:07:25,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product26.cil.c [2019-10-07 15:07:25,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023810693/3b51f37e0d3a4239ac18b6f20a28b704/FLAG1ffe3d3a6 [2019-10-07 15:07:26,390 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:07:26,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product26.cil.c [2019-10-07 15:07:26,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023810693/3b51f37e0d3a4239ac18b6f20a28b704/FLAG1ffe3d3a6 [2019-10-07 15:07:26,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023810693/3b51f37e0d3a4239ac18b6f20a28b704 [2019-10-07 15:07:26,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:07:26,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:07:26,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:07:26,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:07:26,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:07:26,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:07:26" (1/1) ... [2019-10-07 15:07:26,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6ea3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:26, skipping insertion in model container [2019-10-07 15:07:26,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:07:26" (1/1) ... [2019-10-07 15:07:26,587 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:07:26,668 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:07:27,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:07:27,423 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:07:27,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:07:27,779 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:07:27,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27 WrapperNode [2019-10-07 15:07:27,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:07:27,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:07:27,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:07:27,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:07:27,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:27,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:27,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:27,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:27,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:27,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:28,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (1/1) ... [2019-10-07 15:07:28,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:07:28,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:07:28,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:07:28,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:07:28,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (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:07:28,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:07:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:07:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 15:07:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-07 15:07:28,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-07 15:07:28,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-07 15:07:28,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-07 15:07:28,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-07 15:07:28,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-07 15:07:28,132 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-07 15:07:28,132 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-07 15:07:28,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 15:07:28,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:07:28,134 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-07 15:07:28,134 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-07 15:07:28,134 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-07 15:07:28,136 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-07 15:07:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-07 15:07:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-07 15:07:28,138 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-07 15:07:28,138 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-07 15:07:28,138 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-07 15:07:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-07 15:07:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-07 15:07:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-07 15:07:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-07 15:07:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-07 15:07:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-07 15:07:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-07 15:07:28,140 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-07 15:07:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-07 15:07:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-07 15:07:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-07 15:07:28,142 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-07 15:07:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 15:07:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 15:07:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 15:07:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 15:07:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 15:07:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 15:07:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 15:07:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-07 15:07:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-07 15:07:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-07 15:07:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-07 15:07:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-07 15:07:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-07 15:07:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-07 15:07:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-07 15:07:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-07 15:07:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-07 15:07:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-07 15:07:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-07 15:07:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-07 15:07:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-07 15:07:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-07 15:07:28,150 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-07 15:07:28,151 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-07 15:07:28,151 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-07 15:07:28,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-07 15:07:28,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-07 15:07:28,152 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-07 15:07:28,152 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-07 15:07:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-07 15:07:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-07 15:07:28,155 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-07 15:07:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-07 15:07:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-07 15:07:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-07 15:07:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:07:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 15:07:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 15:07:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-07 15:07:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-07 15:07:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-07 15:07:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-07 15:07:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-07 15:07:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-07 15:07:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-07 15:07:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-07 15:07:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-07 15:07:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-07 15:07:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-07 15:07:28,161 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-07 15:07:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-07 15:07:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 15:07:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 15:07:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 15:07:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-07 15:07:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-07 15:07:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-07 15:07:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-07 15:07:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-07 15:07:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-07 15:07:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-07 15:07:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-07 15:07:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-07 15:07:28,177 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-07 15:07:28,178 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-07 15:07:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-07 15:07:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-07 15:07:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-07 15:07:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-07 15:07:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-07 15:07:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-07 15:07:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-07 15:07:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-07 15:07:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-07 15:07:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-07 15:07:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-07 15:07:28,182 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-07 15:07:28,183 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-07 15:07:28,184 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 15:07:28,185 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 15:07:28,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 15:07:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-07 15:07:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-07 15:07:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-07 15:07:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-07 15:07:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-07 15:07:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:07:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 15:07:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:07:32,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:07:32,941 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 15:07:32,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:07:32 BoogieIcfgContainer [2019-10-07 15:07:32,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:07:32,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:07:32,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:07:32,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:07:32,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:07:26" (1/3) ... [2019-10-07 15:07:32,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ca5a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:07:32, skipping insertion in model container [2019-10-07 15:07:32,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:07:27" (2/3) ... [2019-10-07 15:07:32,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ca5a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:07:32, skipping insertion in model container [2019-10-07 15:07:32,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:07:32" (3/3) ... [2019-10-07 15:07:32,953 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product26.cil.c [2019-10-07 15:07:32,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:07:32,982 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:07:32,995 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:07:33,025 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:07:33,025 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:07:33,026 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:07:33,026 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:07:33,026 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:07:33,026 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:07:33,026 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:07:33,026 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:07:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states. [2019-10-07 15:07:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-07 15:07:33,121 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:33,123 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:07:33,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1580393884, now seen corresponding path program 1 times [2019-10-07 15:07:33,142 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:33,142 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:33,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:33,142 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:33,817 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:07:33,818 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:33,818 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:33,818 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 15:07:33,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 15:07:33,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 15:07:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 15:07:33,843 INFO L87 Difference]: Start difference. First operand 420 states. Second operand 2 states. [2019-10-07 15:07:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:33,940 INFO L93 Difference]: Finished difference Result 615 states and 732 transitions. [2019-10-07 15:07:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 15:07:33,942 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 121 [2019-10-07 15:07:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:33,964 INFO L225 Difference]: With dead ends: 615 [2019-10-07 15:07:33,964 INFO L226 Difference]: Without dead ends: 393 [2019-10-07 15:07:33,971 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:07:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-07 15:07:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-10-07 15:07:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 15:07:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 464 transitions. [2019-10-07 15:07:34,109 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 464 transitions. Word has length 121 [2019-10-07 15:07:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:34,112 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 464 transitions. [2019-10-07 15:07:34,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 15:07:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 464 transitions. [2019-10-07 15:07:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-07 15:07:34,126 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:34,129 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:07:34,130 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash -251512447, now seen corresponding path program 1 times [2019-10-07 15:07:34,131 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:34,131 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:34,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:34,394 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:07:34,394 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:34,394 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:34,395 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:34,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:34,403 INFO L87 Difference]: Start difference. First operand 393 states and 464 transitions. Second operand 3 states. [2019-10-07 15:07:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:34,481 INFO L93 Difference]: Finished difference Result 600 states and 701 transitions. [2019-10-07 15:07:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:34,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-07 15:07:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:34,495 INFO L225 Difference]: With dead ends: 600 [2019-10-07 15:07:34,495 INFO L226 Difference]: Without dead ends: 395 [2019-10-07 15:07:34,500 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:07:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-07 15:07:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-07 15:07:34,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-07 15:07:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2019-10-07 15:07:34,549 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 122 [2019-10-07 15:07:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:34,551 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2019-10-07 15:07:34,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2019-10-07 15:07:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-07 15:07:34,557 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:34,557 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:07:34,558 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1716239454, now seen corresponding path program 1 times [2019-10-07 15:07:34,559 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:34,559 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:34,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:34,868 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:07:34,869 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:34,869 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:34,869 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:34,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:34,873 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 3 states. [2019-10-07 15:07:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:34,935 INFO L93 Difference]: Finished difference Result 776 states and 945 transitions. [2019-10-07 15:07:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-07 15:07:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:34,941 INFO L225 Difference]: With dead ends: 776 [2019-10-07 15:07:34,941 INFO L226 Difference]: Without dead ends: 439 [2019-10-07 15:07:34,943 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:07:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-07 15:07:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 438. [2019-10-07 15:07:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-07 15:07:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 540 transitions. [2019-10-07 15:07:34,980 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 540 transitions. Word has length 134 [2019-10-07 15:07:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:34,980 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 540 transitions. [2019-10-07 15:07:34,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 540 transitions. [2019-10-07 15:07:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-07 15:07:34,985 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:34,985 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:07:34,986 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 320807788, now seen corresponding path program 1 times [2019-10-07 15:07:34,986 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:34,988 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:34,988 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,988 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:35,195 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:07:35,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:35,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:35,196 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:35,197 INFO L87 Difference]: Start difference. First operand 438 states and 540 transitions. Second operand 3 states. [2019-10-07 15:07:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:35,255 INFO L93 Difference]: Finished difference Result 695 states and 841 transitions. [2019-10-07 15:07:35,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:35,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-10-07 15:07:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:35,262 INFO L225 Difference]: With dead ends: 695 [2019-10-07 15:07:35,262 INFO L226 Difference]: Without dead ends: 502 [2019-10-07 15:07:35,263 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:07:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-10-07 15:07:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 501. [2019-10-07 15:07:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-07 15:07:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 613 transitions. [2019-10-07 15:07:35,303 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 613 transitions. Word has length 135 [2019-10-07 15:07:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:35,304 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 613 transitions. [2019-10-07 15:07:35,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 613 transitions. [2019-10-07 15:07:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-07 15:07:35,309 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:35,310 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:07:35,311 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1366449552, now seen corresponding path program 1 times [2019-10-07 15:07:35,311 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:35,311 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:35,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:35,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:35,871 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:07:35,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:35,872 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:35,872 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:07:35,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:07:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:07:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:07:35,874 INFO L87 Difference]: Start difference. First operand 501 states and 613 transitions. Second operand 12 states. [2019-10-07 15:07:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:38,901 INFO L93 Difference]: Finished difference Result 1173 states and 1424 transitions. [2019-10-07 15:07:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 15:07:38,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 236 [2019-10-07 15:07:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:38,910 INFO L225 Difference]: With dead ends: 1173 [2019-10-07 15:07:38,910 INFO L226 Difference]: Without dead ends: 922 [2019-10-07 15:07:38,913 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:07:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-07 15:07:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 913. [2019-10-07 15:07:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-07 15:07:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1126 transitions. [2019-10-07 15:07:38,985 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1126 transitions. Word has length 236 [2019-10-07 15:07:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:38,985 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1126 transitions. [2019-10-07 15:07:38,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:07:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1126 transitions. [2019-10-07 15:07:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-07 15:07:38,995 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:38,996 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:07:38,996 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 847477515, now seen corresponding path program 1 times [2019-10-07 15:07:38,997 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:38,998 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:38,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:38,998 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:38,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:39,210 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:07:39,212 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:39,213 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:39,213 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:39,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:39,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:39,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:39,215 INFO L87 Difference]: Start difference. First operand 913 states and 1126 transitions. Second operand 3 states. [2019-10-07 15:07:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:39,266 INFO L93 Difference]: Finished difference Result 1932 states and 2473 transitions. [2019-10-07 15:07:39,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:39,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-07 15:07:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:39,273 INFO L225 Difference]: With dead ends: 1932 [2019-10-07 15:07:39,274 INFO L226 Difference]: Without dead ends: 1077 [2019-10-07 15:07:39,277 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:07:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-10-07 15:07:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1075. [2019-10-07 15:07:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-10-07 15:07:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1404 transitions. [2019-10-07 15:07:39,347 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1404 transitions. Word has length 251 [2019-10-07 15:07:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:39,347 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 1404 transitions. [2019-10-07 15:07:39,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1404 transitions. [2019-10-07 15:07:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-07 15:07:39,355 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:39,356 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:07:39,356 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash -186717215, now seen corresponding path program 1 times [2019-10-07 15:07:39,357 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:39,357 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:39,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:39,357 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:39,612 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:07:39,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:39,612 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:39,612 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:39,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:39,614 INFO L87 Difference]: Start difference. First operand 1075 states and 1404 transitions. Second operand 3 states. [2019-10-07 15:07:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:39,686 INFO L93 Difference]: Finished difference Result 2406 states and 3287 transitions. [2019-10-07 15:07:39,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:39,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-07 15:07:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:39,697 INFO L225 Difference]: With dead ends: 2406 [2019-10-07 15:07:39,698 INFO L226 Difference]: Without dead ends: 1389 [2019-10-07 15:07:39,702 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:07:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2019-10-07 15:07:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1387. [2019-10-07 15:07:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-07 15:07:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1936 transitions. [2019-10-07 15:07:39,802 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1936 transitions. Word has length 252 [2019-10-07 15:07:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:39,805 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 1936 transitions. [2019-10-07 15:07:39,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1936 transitions. [2019-10-07 15:07:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-07 15:07:39,814 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:39,815 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:07:39,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1331981461, now seen corresponding path program 1 times [2019-10-07 15:07:39,816 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:39,816 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:39,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:39,816 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:39,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:40,026 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:07:40,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:40,027 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:40,027 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:40,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:40,031 INFO L87 Difference]: Start difference. First operand 1387 states and 1936 transitions. Second operand 3 states. [2019-10-07 15:07:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:40,164 INFO L93 Difference]: Finished difference Result 3318 states and 4843 transitions. [2019-10-07 15:07:40,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:40,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-07 15:07:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:40,180 INFO L225 Difference]: With dead ends: 3318 [2019-10-07 15:07:40,180 INFO L226 Difference]: Without dead ends: 1989 [2019-10-07 15:07:40,187 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:07:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-10-07 15:07:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1987. [2019-10-07 15:07:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-10-07 15:07:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2952 transitions. [2019-10-07 15:07:40,325 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2952 transitions. Word has length 253 [2019-10-07 15:07:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:40,326 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2952 transitions. [2019-10-07 15:07:40,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2952 transitions. [2019-10-07 15:07:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-07 15:07:40,339 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:40,339 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:07:40,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash -684531340, now seen corresponding path program 1 times [2019-10-07 15:07:40,340 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:40,340 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:40,341 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:40,341 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:40,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:40,689 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:07:40,690 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:40,690 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:40,690 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 15:07:40,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:07:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:07:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-07 15:07:40,691 INFO L87 Difference]: Start difference. First operand 1987 states and 2952 transitions. Second operand 11 states. [2019-10-07 15:07:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:44,461 INFO L93 Difference]: Finished difference Result 2732 states and 3822 transitions. [2019-10-07 15:07:44,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 15:07:44,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2019-10-07 15:07:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:44,477 INFO L225 Difference]: With dead ends: 2732 [2019-10-07 15:07:44,477 INFO L226 Difference]: Without dead ends: 2307 [2019-10-07 15:07:44,480 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:07:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-10-07 15:07:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2290. [2019-10-07 15:07:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-10-07 15:07:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3309 transitions. [2019-10-07 15:07:44,607 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3309 transitions. Word has length 238 [2019-10-07 15:07:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:44,608 INFO L462 AbstractCegarLoop]: Abstraction has 2290 states and 3309 transitions. [2019-10-07 15:07:44,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:07:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3309 transitions. [2019-10-07 15:07:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-07 15:07:44,623 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:44,624 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:07:44,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:44,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash 600025985, now seen corresponding path program 1 times [2019-10-07 15:07:44,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:44,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:44,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:44,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:44,793 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:07:44,793 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:44,793 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:44,794 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:44,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:44,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:44,795 INFO L87 Difference]: Start difference. First operand 2290 states and 3309 transitions. Second operand 3 states. [2019-10-07 15:07:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:44,919 INFO L93 Difference]: Finished difference Result 5676 states and 8525 transitions. [2019-10-07 15:07:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:44,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-10-07 15:07:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:44,940 INFO L225 Difference]: With dead ends: 5676 [2019-10-07 15:07:44,941 INFO L226 Difference]: Without dead ends: 3444 [2019-10-07 15:07:44,949 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:07:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-10-07 15:07:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3442. [2019-10-07 15:07:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-10-07 15:07:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5245 transitions. [2019-10-07 15:07:45,171 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5245 transitions. Word has length 254 [2019-10-07 15:07:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:45,171 INFO L462 AbstractCegarLoop]: Abstraction has 3442 states and 5245 transitions. [2019-10-07 15:07:45,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5245 transitions. [2019-10-07 15:07:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-07 15:07:45,195 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:45,196 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:07:45,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1477739573, now seen corresponding path program 1 times [2019-10-07 15:07:45,197 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:45,197 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:45,198 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:45,198 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:45,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:45,400 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:07:45,401 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:45,401 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:45,401 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:45,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:45,402 INFO L87 Difference]: Start difference. First operand 3442 states and 5245 transitions. Second operand 3 states. [2019-10-07 15:07:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:45,593 INFO L93 Difference]: Finished difference Result 9036 states and 14173 transitions. [2019-10-07 15:07:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:45,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-07 15:07:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:45,633 INFO L225 Difference]: With dead ends: 9036 [2019-10-07 15:07:45,633 INFO L226 Difference]: Without dead ends: 5652 [2019-10-07 15:07:45,648 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:07:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-10-07 15:07:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-10-07 15:07:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-10-07 15:07:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8925 transitions. [2019-10-07 15:07:46,058 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8925 transitions. Word has length 255 [2019-10-07 15:07:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:46,060 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8925 transitions. [2019-10-07 15:07:46,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8925 transitions. [2019-10-07 15:07:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-07 15:07:46,094 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:46,095 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:07:46,095 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:46,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1938973919, now seen corresponding path program 1 times [2019-10-07 15:07:46,096 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:46,096 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:46,096 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:46,096 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:46,426 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:07:46,427 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:46,427 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:07:46,427 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:07:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:07:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:07:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:07:46,429 INFO L87 Difference]: Start difference. First operand 5650 states and 8925 transitions. Second operand 3 states. [2019-10-07 15:07:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:07:46,905 INFO L93 Difference]: Finished difference Result 15468 states and 24893 transitions. [2019-10-07 15:07:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:07:46,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-10-07 15:07:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:07:47,015 INFO L225 Difference]: With dead ends: 15468 [2019-10-07 15:07:47,015 INFO L226 Difference]: Without dead ends: 9876 [2019-10-07 15:07:47,048 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:07:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9876 states. [2019-10-07 15:07:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9876 to 9874. [2019-10-07 15:07:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-10-07 15:07:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 15901 transitions. [2019-10-07 15:07:47,634 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 15901 transitions. Word has length 256 [2019-10-07 15:07:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:07:47,635 INFO L462 AbstractCegarLoop]: Abstraction has 9874 states and 15901 transitions. [2019-10-07 15:07:47,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:07:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 15901 transitions. [2019-10-07 15:07:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 15:07:47,829 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:07:47,830 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:07:47,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:07:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:07:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 96023595, now seen corresponding path program 1 times [2019-10-07 15:07:47,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:07:47,831 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:47,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:47,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:07:47,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:07:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:48,506 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:07:48,506 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:07:48,506 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:07:48,506 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:07:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:07:49,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 3533 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 15:07:49,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:07:49,347 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:07:49,348 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:07:50,480 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:07:50,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 15:07:50,521 INFO L162 IcfgInterpreter]: Started Sifa with 208 locations of interest [2019-10-07 15:07:50,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 15:07:50,528 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 15:07:50,535 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 15:07:50,536 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 15:09:11,459 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 712 [2019-10-07 15:09:15,968 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 326 DAG size of output: 265 [2019-10-07 15:09:16,380 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:09:16,861 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:09:17,434 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 755 [2019-10-07 15:09:17,733 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:09:18,478 WARN L191 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:19,238 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:19,944 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:20,112 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:09:20,825 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:22,208 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 1059 DAG size of output: 1057 [2019-10-07 15:09:22,906 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:23,094 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:09:23,777 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:24,480 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:25,172 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:25,311 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:09:26,025 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 1057 [2019-10-07 15:09:26,058 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 574 for LOIs [2019-10-07 15:09:26,418 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 676 [2019-10-07 15:09:26,545 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 676 [2019-10-07 15:09:26,694 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 456 [2019-10-07 15:09:27,209 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 978 [2019-10-07 15:09:27,211 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1115 for LOIs [2019-10-07 15:09:27,886 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:28,579 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:28,864 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:29,971 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:30,652 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:31,316 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:31,586 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:32,667 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:33,409 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:34,074 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:34,361 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:35,457 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:36,575 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1115 [2019-10-07 15:09:37,246 WARN L191 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:37,771 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 647 DAG size of output: 645 [2019-10-07 15:09:38,867 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:39,547 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:40,216 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:40,481 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:41,599 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:42,264 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:42,932 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:43,198 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:44,288 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:44,973 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:45,641 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:45,914 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:47,008 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:47,678 WARN L191 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:48,345 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:48,654 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:49,741 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:50,412 WARN L191 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:51,110 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:51,378 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:52,470 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:53,136 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:53,806 WARN L191 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:54,074 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:55,165 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:55,844 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:56,521 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:56,787 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:09:57,858 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:09:58,534 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:59,206 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:09:59,477 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:00,541 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:01,213 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:10:01,896 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 1115 [2019-10-07 15:10:02,169 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:03,254 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:04,366 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:05,446 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:05,910 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:07,006 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:09,029 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:10:10,127 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:10,412 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:11,489 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:12,583 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:13,669 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:13,936 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:15,011 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:16,148 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:17,257 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:17,533 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:10:18,626 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:20,555 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 1315 DAG size of output: 1311 [2019-10-07 15:10:21,672 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:10:21,964 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:10:23,053 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:24,932 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 1315 DAG size of output: 1311 [2019-10-07 15:10:26,018 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:10:26,285 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:10:27,370 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:28,469 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:10:29,539 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:10:29,827 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:10:30,918 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:32,015 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:33,136 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:10:33,421 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:10:34,516 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1315 [2019-10-07 15:10:37,278 WARN L191 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:10:38,385 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:38,660 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:39,750 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:42,338 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:10:43,418 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:43,702 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:44,762 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:45,853 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:46,961 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:47,232 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:48,298 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:50,285 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:10:51,350 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:51,631 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:52,695 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:55,029 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 1311 DAG size of output: 1309 [2019-10-07 15:10:56,090 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:56,370 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:10:57,424 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:58,491 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:59,557 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:10:59,821 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-10-07 15:11:00,876 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1309 [2019-10-07 15:11:02,873 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 1315 DAG size of output: 1311 [2019-10-07 15:11:03,936 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:11:04,210 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:11:05,288 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:06,370 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:07,449 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:07,731 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:11:08,802 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:10,732 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 1315 DAG size of output: 1311 [2019-10-07 15:11:11,789 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 1311 [2019-10-07 15:11:12,052 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:11:13,121 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:14,966 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 1320 DAG size of output: 1313 [2019-10-07 15:11:16,033 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:16,301 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:11:17,362 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1313 [2019-10-07 15:11:19,222 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 1322 DAG size of output: 1315 [2019-10-07 15:11:20,295 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 1315 [2019-10-07 15:11:20,564 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-10-07 15:11:21,624 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 1315 [2019-10-07 15:11:21,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:11:21,921 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:11:21,933 INFO L168 Benchmark]: Toolchain (without parser) took 235357.12 ms. Allocated memory was 138.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 129.1 MB. Max. memory is 7.1 GB. [2019-10-07 15:11:21,934 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 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:11:21,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1207.75 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 135.8 MB in the end (delta: -35.7 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-10-07 15:11:21,936 INFO L168 Benchmark]: Boogie Preprocessor took 258.11 ms. Allocated memory is still 203.9 MB. Free memory was 135.8 MB in the beginning and 126.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-10-07 15:11:21,937 INFO L168 Benchmark]: RCFGBuilder took 4903.80 ms. Allocated memory was 203.9 MB in the beginning and 302.0 MB in the end (delta: 98.0 MB). Free memory was 126.7 MB in the beginning and 88.3 MB in the end (delta: 38.5 MB). Peak memory consumption was 136.5 MB. Max. memory is 7.1 GB. [2019-10-07 15:11:21,937 INFO L168 Benchmark]: TraceAbstraction took 228981.71 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 85.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 15:11:21,940 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1207.75 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.0 MB in the beginning and 135.8 MB in the end (delta: -35.7 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 258.11 ms. Allocated memory is still 203.9 MB. Free memory was 135.8 MB in the beginning and 126.7 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4903.80 ms. Allocated memory was 203.9 MB in the beginning and 302.0 MB in the end (delta: 98.0 MB). Free memory was 126.7 MB in the beginning and 88.3 MB in the end (delta: 38.5 MB). Peak memory consumption was 136.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228981.71 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 85.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). There was no memory consumed. 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...