./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8be154d3e1e3530184c878a0d9a3b350197adb1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:52,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:52,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:52,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:52,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:52,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:52,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:52,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:52,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:52,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:52,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:52,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:52,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:52,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:52,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:52,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:52,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:52,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:52,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:52,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:52,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:52,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:52,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:52,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:52,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:52,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:52,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:52,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:52,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:52,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:52,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:52,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:52,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:52,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:52,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:52,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:52,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:52,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:52,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:52,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:52,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:52,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:52,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:52,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:52,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:52,266 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:52,266 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:52,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:52,268 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:52,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:52,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:52,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:52,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:52,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:52,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:52,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:52,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:52,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:52,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:52,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:52,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:52,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:52,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:52,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:52,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:52,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:52,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:52,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:52,272 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:52,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:52,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:52,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:52,273 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8be154d3e1e3530184c878a0d9a3b350197adb1 [2019-10-22 11:25:52,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:52,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:52,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:52,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:52,334 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:52,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2019-10-22 11:25:52,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/data/37c004e86/ec88a4a74aad4e5e8fa9b6416ccef39f/FLAGd829f832b [2019-10-22 11:25:52,972 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:52,976 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2019-10-22 11:25:53,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/data/37c004e86/ec88a4a74aad4e5e8fa9b6416ccef39f/FLAGd829f832b [2019-10-22 11:25:53,176 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/data/37c004e86/ec88a4a74aad4e5e8fa9b6416ccef39f [2019-10-22 11:25:53,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:53,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:53,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:53,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:53,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:53,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:53" (1/1) ... [2019-10-22 11:25:53,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12535d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:53, skipping insertion in model container [2019-10-22 11:25:53,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:53" (1/1) ... [2019-10-22 11:25:53,197 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:53,252 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:53,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:53,932 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:54,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:54,156 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:54,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54 WrapperNode [2019-10-22 11:25:54,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:54,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:54,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:54,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:54,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:54,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:54,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:54,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:54,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... [2019-10-22 11:25:54,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:54,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:54,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:54,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:54,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/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-22 11:25:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:25:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:25:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:25:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:56,252 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:56,252 INFO L284 CfgBuilder]: Removed 227 assume(true) statements. [2019-10-22 11:25:56,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:56 BoogieIcfgContainer [2019-10-22 11:25:56,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:56,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:56,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:56,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:56,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:53" (1/3) ... [2019-10-22 11:25:56,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee8290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:56, skipping insertion in model container [2019-10-22 11:25:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:54" (2/3) ... [2019-10-22 11:25:56,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee8290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:56, skipping insertion in model container [2019-10-22 11:25:56,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:56" (3/3) ... [2019-10-22 11:25:56,266 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2019-10-22 11:25:56,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:56,291 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:25:56,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:25:56,346 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:56,346 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:56,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:56,347 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:56,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:56,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:56,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:56,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states. [2019-10-22 11:25:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:25:56,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:56,399 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:56,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1419939679, now seen corresponding path program 1 times [2019-10-22 11:25:56,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:56,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582613298] [2019-10-22 11:25:56,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:56,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:56,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582613298] [2019-10-22 11:25:56,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:56,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:56,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568204745] [2019-10-22 11:25:56,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:56,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:56,900 INFO L87 Difference]: Start difference. First operand 381 states. Second operand 3 states. [2019-10-22 11:25:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:57,096 INFO L93 Difference]: Finished difference Result 1108 states and 1955 transitions. [2019-10-22 11:25:57,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:57,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 11:25:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:57,125 INFO L225 Difference]: With dead ends: 1108 [2019-10-22 11:25:57,125 INFO L226 Difference]: Without dead ends: 676 [2019-10-22 11:25:57,135 INFO L600 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-22 11:25:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-22 11:25:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 347. [2019-10-22 11:25:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 607 transitions. [2019-10-22 11:25:57,231 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 607 transitions. Word has length 41 [2019-10-22 11:25:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:57,232 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 607 transitions. [2019-10-22 11:25:57,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 607 transitions. [2019-10-22 11:25:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:25:57,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:57,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:57,237 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1242424365, now seen corresponding path program 1 times [2019-10-22 11:25:57,237 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:57,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656948546] [2019-10-22 11:25:57,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:57,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656948546] [2019-10-22 11:25:57,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:57,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:57,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465222993] [2019-10-22 11:25:57,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:57,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:57,394 INFO L87 Difference]: Start difference. First operand 347 states and 607 transitions. Second operand 5 states. [2019-10-22 11:25:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:57,677 INFO L93 Difference]: Finished difference Result 990 states and 1737 transitions. [2019-10-22 11:25:57,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:57,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-22 11:25:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:57,681 INFO L225 Difference]: With dead ends: 990 [2019-10-22 11:25:57,683 INFO L226 Difference]: Without dead ends: 662 [2019-10-22 11:25:57,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-22 11:25:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2019-10-22 11:25:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 606 transitions. [2019-10-22 11:25:57,736 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 606 transitions. Word has length 43 [2019-10-22 11:25:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:57,736 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 606 transitions. [2019-10-22 11:25:57,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 606 transitions. [2019-10-22 11:25:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:25:57,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:57,742 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:57,742 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1132714688, now seen corresponding path program 1 times [2019-10-22 11:25:57,743 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:57,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905467771] [2019-10-22 11:25:57,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:57,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905467771] [2019-10-22 11:25:57,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:57,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:57,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306764648] [2019-10-22 11:25:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:57,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:57,847 INFO L87 Difference]: Start difference. First operand 347 states and 606 transitions. Second operand 3 states. [2019-10-22 11:25:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:57,884 INFO L93 Difference]: Finished difference Result 676 states and 1186 transitions. [2019-10-22 11:25:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:57,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:25:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:57,888 INFO L225 Difference]: With dead ends: 676 [2019-10-22 11:25:57,888 INFO L226 Difference]: Without dead ends: 352 [2019-10-22 11:25:57,889 INFO L600 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-22 11:25:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-22 11:25:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 347. [2019-10-22 11:25:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 605 transitions. [2019-10-22 11:25:57,917 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 605 transitions. Word has length 44 [2019-10-22 11:25:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:57,918 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 605 transitions. [2019-10-22 11:25:57,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 605 transitions. [2019-10-22 11:25:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:25:57,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:57,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:57,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash 542876218, now seen corresponding path program 1 times [2019-10-22 11:25:57,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:57,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305037368] [2019-10-22 11:25:57,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:57,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:58,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305037368] [2019-10-22 11:25:58,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:58,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:58,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374400916] [2019-10-22 11:25:58,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:58,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:58,019 INFO L87 Difference]: Start difference. First operand 347 states and 605 transitions. Second operand 3 states. [2019-10-22 11:25:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:58,057 INFO L93 Difference]: Finished difference Result 686 states and 1199 transitions. [2019-10-22 11:25:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 11:25:58,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:58,066 INFO L225 Difference]: With dead ends: 686 [2019-10-22 11:25:58,066 INFO L226 Difference]: Without dead ends: 347 [2019-10-22 11:25:58,067 INFO L600 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-22 11:25:58,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-10-22 11:25:58,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-10-22 11:25:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 603 transitions. [2019-10-22 11:25:58,085 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 603 transitions. Word has length 45 [2019-10-22 11:25:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:58,086 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 603 transitions. [2019-10-22 11:25:58,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 603 transitions. [2019-10-22 11:25:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 11:25:58,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:58,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:58,088 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:58,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1391705979, now seen corresponding path program 1 times [2019-10-22 11:25:58,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:58,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159481666] [2019-10-22 11:25:58,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:58,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159481666] [2019-10-22 11:25:58,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:58,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:58,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878768905] [2019-10-22 11:25:58,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:58,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:58,203 INFO L87 Difference]: Start difference. First operand 347 states and 603 transitions. Second operand 5 states. [2019-10-22 11:25:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:58,353 INFO L93 Difference]: Finished difference Result 980 states and 1717 transitions. [2019-10-22 11:25:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:58,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 11:25:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:58,358 INFO L225 Difference]: With dead ends: 980 [2019-10-22 11:25:58,359 INFO L226 Difference]: Without dead ends: 660 [2019-10-22 11:25:58,359 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-22 11:25:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 347. [2019-10-22 11:25:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 602 transitions. [2019-10-22 11:25:58,379 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 602 transitions. Word has length 46 [2019-10-22 11:25:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:58,379 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 602 transitions. [2019-10-22 11:25:58,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 602 transitions. [2019-10-22 11:25:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:25:58,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:58,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:58,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:58,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2141186050, now seen corresponding path program 1 times [2019-10-22 11:25:58,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:58,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502226527] [2019-10-22 11:25:58,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:58,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502226527] [2019-10-22 11:25:58,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:58,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:58,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595203329] [2019-10-22 11:25:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:58,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:58,466 INFO L87 Difference]: Start difference. First operand 347 states and 602 transitions. Second operand 5 states. [2019-10-22 11:25:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:58,625 INFO L93 Difference]: Finished difference Result 985 states and 1722 transitions. [2019-10-22 11:25:58,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:58,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 11:25:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:58,628 INFO L225 Difference]: With dead ends: 985 [2019-10-22 11:25:58,629 INFO L226 Difference]: Without dead ends: 665 [2019-10-22 11:25:58,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-10-22 11:25:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 347. [2019-10-22 11:25:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-22 11:25:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 601 transitions. [2019-10-22 11:25:58,650 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 601 transitions. Word has length 47 [2019-10-22 11:25:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:58,651 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 601 transitions. [2019-10-22 11:25:58,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 601 transitions. [2019-10-22 11:25:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:25:58,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:58,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:25:58,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:58,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 504792042, now seen corresponding path program 1 times [2019-10-22 11:25:58,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:58,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994610016] [2019-10-22 11:25:58,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:58,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994610016] [2019-10-22 11:25:58,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:58,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:58,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290873129] [2019-10-22 11:25:58,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:58,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:58,709 INFO L87 Difference]: Start difference. First operand 347 states and 601 transitions. Second operand 3 states. [2019-10-22 11:25:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:58,731 INFO L93 Difference]: Finished difference Result 460 states and 785 transitions. [2019-10-22 11:25:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:58,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 11:25:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:58,734 INFO L225 Difference]: With dead ends: 460 [2019-10-22 11:25:58,734 INFO L226 Difference]: Without dead ends: 350 [2019-10-22 11:25:58,734 INFO L600 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-22 11:25:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-22 11:25:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-10-22 11:25:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-22 11:25:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 603 transitions. [2019-10-22 11:25:58,752 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 603 transitions. Word has length 48 [2019-10-22 11:25:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:58,752 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 603 transitions. [2019-10-22 11:25:58,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 603 transitions. [2019-10-22 11:25:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:25:58,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:58,754 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:58,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1344122196, now seen corresponding path program 1 times [2019-10-22 11:25:58,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:58,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592495871] [2019-10-22 11:25:58,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:58,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592495871] [2019-10-22 11:25:58,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:58,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:58,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900283463] [2019-10-22 11:25:58,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:58,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:58,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:58,807 INFO L87 Difference]: Start difference. First operand 349 states and 603 transitions. Second operand 3 states. [2019-10-22 11:25:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:58,842 INFO L93 Difference]: Finished difference Result 933 states and 1633 transitions. [2019-10-22 11:25:58,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:58,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:25:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:58,845 INFO L225 Difference]: With dead ends: 933 [2019-10-22 11:25:58,846 INFO L226 Difference]: Without dead ends: 615 [2019-10-22 11:25:58,846 INFO L600 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-22 11:25:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-22 11:25:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 505. [2019-10-22 11:25:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-22 11:25:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 889 transitions. [2019-10-22 11:25:58,874 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 889 transitions. Word has length 54 [2019-10-22 11:25:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:58,875 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 889 transitions. [2019-10-22 11:25:58,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 889 transitions. [2019-10-22 11:25:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:25:58,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:58,878 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:58,878 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1900507155, now seen corresponding path program 1 times [2019-10-22 11:25:58,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:58,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929841040] [2019-10-22 11:25:58,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:58,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:59,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929841040] [2019-10-22 11:25:59,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:59,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:25:59,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755129569] [2019-10-22 11:25:59,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:25:59,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:59,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:25:59,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:59,016 INFO L87 Difference]: Start difference. First operand 505 states and 889 transitions. Second operand 9 states. [2019-10-22 11:26:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:00,001 INFO L93 Difference]: Finished difference Result 1541 states and 2635 transitions. [2019-10-22 11:26:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:00,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-22 11:26:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:00,008 INFO L225 Difference]: With dead ends: 1541 [2019-10-22 11:26:00,008 INFO L226 Difference]: Without dead ends: 1451 [2019-10-22 11:26:00,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-22 11:26:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 949. [2019-10-22 11:26:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-10-22 11:26:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1689 transitions. [2019-10-22 11:26:00,095 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1689 transitions. Word has length 55 [2019-10-22 11:26:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 1689 transitions. [2019-10-22 11:26:00,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1689 transitions. [2019-10-22 11:26:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:26:00,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:00,098 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:00,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash 312495338, now seen corresponding path program 1 times [2019-10-22 11:26:00,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:00,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078035522] [2019-10-22 11:26:00,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:00,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078035522] [2019-10-22 11:26:00,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:00,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:00,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293219910] [2019-10-22 11:26:00,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:00,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:00,213 INFO L87 Difference]: Start difference. First operand 949 states and 1689 transitions. Second operand 4 states. [2019-10-22 11:26:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:00,429 INFO L93 Difference]: Finished difference Result 1920 states and 3336 transitions. [2019-10-22 11:26:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:00,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-22 11:26:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:00,436 INFO L225 Difference]: With dead ends: 1920 [2019-10-22 11:26:00,436 INFO L226 Difference]: Without dead ends: 1772 [2019-10-22 11:26:00,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-10-22 11:26:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1468. [2019-10-22 11:26:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-10-22 11:26:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2612 transitions. [2019-10-22 11:26:00,519 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2612 transitions. Word has length 56 [2019-10-22 11:26:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:00,520 INFO L462 AbstractCegarLoop]: Abstraction has 1468 states and 2612 transitions. [2019-10-22 11:26:00,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2612 transitions. [2019-10-22 11:26:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 11:26:00,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:00,522 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:00,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash -274310676, now seen corresponding path program 1 times [2019-10-22 11:26:00,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:00,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442683902] [2019-10-22 11:26:00,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:00,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442683902] [2019-10-22 11:26:00,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:00,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:00,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488615291] [2019-10-22 11:26:00,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:00,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:00,576 INFO L87 Difference]: Start difference. First operand 1468 states and 2612 transitions. Second operand 3 states. [2019-10-22 11:26:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:00,638 INFO L93 Difference]: Finished difference Result 1640 states and 2886 transitions. [2019-10-22 11:26:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:00,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 11:26:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:00,643 INFO L225 Difference]: With dead ends: 1640 [2019-10-22 11:26:00,643 INFO L226 Difference]: Without dead ends: 1450 [2019-10-22 11:26:00,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 11:26:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-22 11:26:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2019-10-22 11:26:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2019-10-22 11:26:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2579 transitions. [2019-10-22 11:26:00,715 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2579 transitions. Word has length 56 [2019-10-22 11:26:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 1450 states and 2579 transitions. [2019-10-22 11:26:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2579 transitions. [2019-10-22 11:26:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:26:00,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:00,719 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:00,720 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1680737127, now seen corresponding path program 1 times [2019-10-22 11:26:00,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:00,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570493246] [2019-10-22 11:26:00,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:00,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570493246] [2019-10-22 11:26:00,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:00,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:00,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885391640] [2019-10-22 11:26:00,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:00,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:00,782 INFO L87 Difference]: Start difference. First operand 1450 states and 2579 transitions. Second operand 4 states. [2019-10-22 11:26:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:00,851 INFO L93 Difference]: Finished difference Result 1553 states and 2748 transitions. [2019-10-22 11:26:00,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:00,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-22 11:26:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:00,857 INFO L225 Difference]: With dead ends: 1553 [2019-10-22 11:26:00,857 INFO L226 Difference]: Without dead ends: 1383 [2019-10-22 11:26:00,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-10-22 11:26:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2019-10-22 11:26:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-10-22 11:26:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2466 transitions. [2019-10-22 11:26:00,933 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2466 transitions. Word has length 82 [2019-10-22 11:26:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:00,933 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 2466 transitions. [2019-10-22 11:26:00,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2466 transitions. [2019-10-22 11:26:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:26:00,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:00,936 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:00,936 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1102479568, now seen corresponding path program 1 times [2019-10-22 11:26:00,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:00,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203623339] [2019-10-22 11:26:00,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:01,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203623339] [2019-10-22 11:26:01,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:01,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:01,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651478220] [2019-10-22 11:26:01,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:01,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:01,048 INFO L87 Difference]: Start difference. First operand 1383 states and 2466 transitions. Second operand 9 states. [2019-10-22 11:26:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:01,431 INFO L93 Difference]: Finished difference Result 1867 states and 3240 transitions. [2019-10-22 11:26:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:01,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-10-22 11:26:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:01,438 INFO L225 Difference]: With dead ends: 1867 [2019-10-22 11:26:01,438 INFO L226 Difference]: Without dead ends: 1748 [2019-10-22 11:26:01,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-10-22 11:26:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1389. [2019-10-22 11:26:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1389 states. [2019-10-22 11:26:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2472 transitions. [2019-10-22 11:26:01,529 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2472 transitions. Word has length 83 [2019-10-22 11:26:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:01,530 INFO L462 AbstractCegarLoop]: Abstraction has 1389 states and 2472 transitions. [2019-10-22 11:26:01,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2472 transitions. [2019-10-22 11:26:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:26:01,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:01,534 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:01,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash 12519486, now seen corresponding path program 1 times [2019-10-22 11:26:01,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:01,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80015343] [2019-10-22 11:26:01,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:01,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:01,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:01,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80015343] [2019-10-22 11:26:01,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:01,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:01,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039706841] [2019-10-22 11:26:01,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:01,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:01,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:01,636 INFO L87 Difference]: Start difference. First operand 1389 states and 2472 transitions. Second operand 6 states. [2019-10-22 11:26:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:01,982 INFO L93 Difference]: Finished difference Result 2943 states and 5199 transitions. [2019-10-22 11:26:01,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:01,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-22 11:26:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:01,993 INFO L225 Difference]: With dead ends: 2943 [2019-10-22 11:26:01,993 INFO L226 Difference]: Without dead ends: 2878 [2019-10-22 11:26:01,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2019-10-22 11:26:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2643. [2019-10-22 11:26:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-10-22 11:26:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4731 transitions. [2019-10-22 11:26:02,137 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4731 transitions. Word has length 84 [2019-10-22 11:26:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:02,138 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 4731 transitions. [2019-10-22 11:26:02,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4731 transitions. [2019-10-22 11:26:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:26:02,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:02,144 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:02,144 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1749467236, now seen corresponding path program 1 times [2019-10-22 11:26:02,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:02,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473878845] [2019-10-22 11:26:02,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:02,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:02,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:02,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473878845] [2019-10-22 11:26:02,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:02,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:02,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907419557] [2019-10-22 11:26:02,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:02,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:02,247 INFO L87 Difference]: Start difference. First operand 2643 states and 4731 transitions. Second operand 8 states. [2019-10-22 11:26:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:02,548 INFO L93 Difference]: Finished difference Result 2996 states and 5303 transitions. [2019-10-22 11:26:02,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:26:02,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-10-22 11:26:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:02,558 INFO L225 Difference]: With dead ends: 2996 [2019-10-22 11:26:02,558 INFO L226 Difference]: Without dead ends: 2640 [2019-10-22 11:26:02,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2019-10-22 11:26:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2607. [2019-10-22 11:26:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2019-10-22 11:26:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 4657 transitions. [2019-10-22 11:26:02,694 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 4657 transitions. Word has length 84 [2019-10-22 11:26:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:02,694 INFO L462 AbstractCegarLoop]: Abstraction has 2607 states and 4657 transitions. [2019-10-22 11:26:02,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 4657 transitions. [2019-10-22 11:26:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:02,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:02,700 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:02,700 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 738594347, now seen corresponding path program 1 times [2019-10-22 11:26:02,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:02,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181301743] [2019-10-22 11:26:02,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:02,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:02,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:02,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181301743] [2019-10-22 11:26:02,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:02,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:02,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065483825] [2019-10-22 11:26:02,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:02,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:02,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:02,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:02,804 INFO L87 Difference]: Start difference. First operand 2607 states and 4657 transitions. Second operand 8 states. [2019-10-22 11:26:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:03,116 INFO L93 Difference]: Finished difference Result 2759 states and 4897 transitions. [2019-10-22 11:26:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:03,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-10-22 11:26:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:03,126 INFO L225 Difference]: With dead ends: 2759 [2019-10-22 11:26:03,126 INFO L226 Difference]: Without dead ends: 2637 [2019-10-22 11:26:03,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:26:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2019-10-22 11:26:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2604. [2019-10-22 11:26:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2604 states. [2019-10-22 11:26:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 4645 transitions. [2019-10-22 11:26:03,265 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 4645 transitions. Word has length 85 [2019-10-22 11:26:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:03,266 INFO L462 AbstractCegarLoop]: Abstraction has 2604 states and 4645 transitions. [2019-10-22 11:26:03,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 4645 transitions. [2019-10-22 11:26:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:03,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:03,272 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:03,272 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1592644432, now seen corresponding path program 1 times [2019-10-22 11:26:03,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:03,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946136348] [2019-10-22 11:26:03,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:03,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:03,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:03,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946136348] [2019-10-22 11:26:03,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:03,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:03,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404787762] [2019-10-22 11:26:03,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:03,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:03,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:03,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:03,382 INFO L87 Difference]: Start difference. First operand 2604 states and 4645 transitions. Second operand 4 states. [2019-10-22 11:26:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:03,621 INFO L93 Difference]: Finished difference Result 5228 states and 9313 transitions. [2019-10-22 11:26:03,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:03,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-22 11:26:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:03,637 INFO L225 Difference]: With dead ends: 5228 [2019-10-22 11:26:03,638 INFO L226 Difference]: Without dead ends: 3878 [2019-10-22 11:26:03,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2019-10-22 11:26:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2591. [2019-10-22 11:26:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2019-10-22 11:26:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4628 transitions. [2019-10-22 11:26:03,797 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 4628 transitions. Word has length 85 [2019-10-22 11:26:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:03,797 INFO L462 AbstractCegarLoop]: Abstraction has 2591 states and 4628 transitions. [2019-10-22 11:26:03,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4628 transitions. [2019-10-22 11:26:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 11:26:03,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:03,803 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:03,803 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:03,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1780593588, now seen corresponding path program 1 times [2019-10-22 11:26:03,804 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:03,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110561918] [2019-10-22 11:26:03,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:03,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:03,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:26:03,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110561918] [2019-10-22 11:26:03,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:03,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:26:03,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098150747] [2019-10-22 11:26:03,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:03,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:03,903 INFO L87 Difference]: Start difference. First operand 2591 states and 4628 transitions. Second operand 8 states. [2019-10-22 11:26:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:04,220 INFO L93 Difference]: Finished difference Result 2591 states and 4628 transitions. [2019-10-22 11:26:04,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:04,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-10-22 11:26:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:04,221 INFO L225 Difference]: With dead ends: 2591 [2019-10-22 11:26:04,221 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:04,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:04,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2019-10-22 11:26:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:04,225 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:04,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:04,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:04,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:26:04,431 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 132 [2019-10-22 11:26:04,580 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 132 [2019-10-22 11:26:04,779 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 134 [2019-10-22 11:26:05,054 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:05,257 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2019-10-22 11:26:05,482 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2019-10-22 11:26:05,760 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:06,209 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:06,457 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:06,986 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-10-22 11:26:07,944 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 47 [2019-10-22 11:26:08,272 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 47 [2019-10-22 11:26:08,388 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:08,704 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 49 [2019-10-22 11:26:09,400 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:09,564 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2019-10-22 11:26:10,038 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 51 [2019-10-22 11:26:10,455 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 47 [2019-10-22 11:26:11,134 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:11,443 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 36 [2019-10-22 11:26:11,579 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 38 [2019-10-22 11:26:12,406 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:13,135 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:13,312 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-10-22 11:26:13,783 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 45 [2019-10-22 11:26:14,512 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:14,626 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:15,075 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:15,482 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 45 [2019-10-22 11:26:15,915 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 45 [2019-10-22 11:26:16,273 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 45 [2019-10-22 11:26:16,619 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 44 [2019-10-22 11:26:16,982 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2019-10-22 11:26:17,183 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:17,286 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:17,387 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:17,827 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 47 [2019-10-22 11:26:18,184 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:18,304 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-10-22 11:26:18,306 INFO L439 ceAbstractionStarter]: At program point L2017(lines 2004 2022) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,306 INFO L439 ceAbstractionStarter]: At program point L2017-1(lines 2004 2022) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,306 INFO L439 ceAbstractionStarter]: At program point L2017-2(lines 2004 2022) the Hoare annotation is: false [2019-10-22 11:26:18,306 INFO L446 ceAbstractionStarter]: At program point L2017-3(lines 2004 2022) the Hoare annotation is: true [2019-10-22 11:26:18,306 INFO L443 ceAbstractionStarter]: For program point L1621(lines 1621 1637) no Hoare annotation was computed. [2019-10-22 11:26:18,306 INFO L443 ceAbstractionStarter]: For program point L1621-1(lines 1621 1637) no Hoare annotation was computed. [2019-10-22 11:26:18,307 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1429) no Hoare annotation was computed. [2019-10-22 11:26:18,307 INFO L443 ceAbstractionStarter]: For program point L1491(lines 1491 1497) no Hoare annotation was computed. [2019-10-22 11:26:18,307 INFO L443 ceAbstractionStarter]: For program point L1491-1(lines 1491 1497) no Hoare annotation was computed. [2019-10-22 11:26:18,307 INFO L439 ceAbstractionStarter]: At program point L1293(lines 1273 1297) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,307 INFO L439 ceAbstractionStarter]: At program point L1293-1(lines 1273 1297) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,307 INFO L439 ceAbstractionStarter]: At program point L1293-2(lines 1273 1297) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,307 INFO L439 ceAbstractionStarter]: At program point L1293-3(lines 1273 1297) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,308 INFO L439 ceAbstractionStarter]: At program point L1293-4(lines 1273 1297) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,308 INFO L439 ceAbstractionStarter]: At program point L171(lines 161 244) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,308 INFO L443 ceAbstractionStarter]: For program point L1625(lines 1625 1636) no Hoare annotation was computed. [2019-10-22 11:26:18,308 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 1625 1636) no Hoare annotation was computed. [2019-10-22 11:26:18,308 INFO L439 ceAbstractionStarter]: At program point L304(lines 299 307) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:18,308 INFO L439 ceAbstractionStarter]: At program point L2815-1(lines 2800 2825) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,308 INFO L443 ceAbstractionStarter]: For program point L2815(lines 2815 2821) no Hoare annotation was computed. [2019-10-22 11:26:18,308 INFO L446 ceAbstractionStarter]: At program point L2815-3(lines 2800 2825) the Hoare annotation is: true [2019-10-22 11:26:18,309 INFO L443 ceAbstractionStarter]: For program point L2815-2(lines 2815 2821) no Hoare annotation was computed. [2019-10-22 11:26:18,309 INFO L439 ceAbstractionStarter]: At program point L107(lines 94 249) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,309 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1635) no Hoare annotation was computed. [2019-10-22 11:26:18,309 INFO L443 ceAbstractionStarter]: For program point L1629-1(lines 1629 1635) no Hoare annotation was computed. [2019-10-22 11:26:18,309 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1401) no Hoare annotation was computed. [2019-10-22 11:26:18,309 INFO L443 ceAbstractionStarter]: For program point L1365-1(lines 1365 1401) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1365-2(lines 1365 1401) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1365-3(lines 1365 1401) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1233(lines 1233 1249) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1365-4(lines 1365 1401) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1233-1(lines 1233 1249) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 183) no Hoare annotation was computed. [2019-10-22 11:26:18,310 INFO L443 ceAbstractionStarter]: For program point L1233-2(lines 1233 1249) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1233-3(lines 1233 1249) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1233-4(lines 1233 1249) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1463) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1366(lines 1366 1374) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1366-2(lines 1366 1374) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1366-4(lines 1366 1374) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1366-6(lines 1366 1374) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1366-8(lines 1366 1374) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L2027(lines 2027 2035) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 1444) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L2160(lines 2160 2171) no Hoare annotation was computed. [2019-10-22 11:26:18,311 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L2160-1(lines 2160 2171) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 1516) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1500-1(lines 1500 1516) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L2690(line 2690) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L2690-1(line 2690) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1512) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1501-1(lines 1501 1512) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1369(lines 1369 1373) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1369-3(lines 1369 1373) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1248) no Hoare annotation was computed. [2019-10-22 11:26:18,312 INFO L443 ceAbstractionStarter]: For program point L1237-1(lines 1237 1248) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1237-2(lines 1237 1248) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1369-6(lines 1369 1373) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1237-3(lines 1237 1248) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1237-4(lines 1237 1248) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1369-9(lines 1369 1373) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L2030(lines 2030 2034) no Hoare annotation was computed. [2019-10-22 11:26:18,313 INFO L443 ceAbstractionStarter]: For program point L1369-12(lines 1369 1373) no Hoare annotation was computed. [2019-10-22 11:26:18,314 INFO L439 ceAbstractionStarter]: At program point L2030-2(lines 2023 2038) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_email_to0~0 2) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,314 INFO L439 ceAbstractionStarter]: At program point L1634(lines 1617 1640) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,314 INFO L439 ceAbstractionStarter]: At program point L1634-1(lines 1617 1640) the Hoare annotation is: false [2019-10-22 11:26:18,314 INFO L443 ceAbstractionStarter]: For program point L1767(lines 1767 1789) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L439 ceAbstractionStarter]: At program point L1767-1(lines 1767 1789) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1767-2(lines 1767 1789) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L446 ceAbstractionStarter]: At program point L1767-3(lines 1767 1789) the Hoare annotation is: true [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1437(lines 1437 1443) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L2164(lines 2164 2170) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L2164-1(lines 2164 2170) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1505(lines 1505 1511) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 1505 1511) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1247) no Hoare annotation was computed. [2019-10-22 11:26:18,315 INFO L443 ceAbstractionStarter]: For program point L1241-1(lines 1241 1247) no Hoare annotation was computed. [2019-10-22 11:26:18,316 INFO L443 ceAbstractionStarter]: For program point L1241-2(lines 1241 1247) no Hoare annotation was computed. [2019-10-22 11:26:18,316 INFO L439 ceAbstractionStarter]: At program point L118(lines 108 248) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,316 INFO L443 ceAbstractionStarter]: For program point L1241-3(lines 1241 1247) no Hoare annotation was computed. [2019-10-22 11:26:18,316 INFO L443 ceAbstractionStarter]: For program point L1241-4(lines 1241 1247) no Hoare annotation was computed. [2019-10-22 11:26:18,316 INFO L439 ceAbstractionStarter]: At program point L251(lines 85 252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,316 INFO L439 ceAbstractionStarter]: At program point L185(lines 172 243) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,316 INFO L443 ceAbstractionStarter]: For program point L1771(lines 1771 1786) no Hoare annotation was computed. [2019-10-22 11:26:18,316 INFO L443 ceAbstractionStarter]: For program point L1771-2(lines 1771 1786) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L443 ceAbstractionStarter]: For program point L1376(lines 1376 1400) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L443 ceAbstractionStarter]: For program point L1376-1(lines 1376 1400) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L443 ceAbstractionStarter]: For program point L1376-2(lines 1376 1400) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L443 ceAbstractionStarter]: For program point L1376-3(lines 1376 1400) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L443 ceAbstractionStarter]: For program point L1376-4(lines 1376 1400) no Hoare annotation was computed. [2019-10-22 11:26:18,317 INFO L446 ceAbstractionStarter]: At program point L2169-1(lines 2156 2174) the Hoare annotation is: true [2019-10-22 11:26:18,318 INFO L439 ceAbstractionStarter]: At program point L2169(lines 2156 2174) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,318 INFO L439 ceAbstractionStarter]: At program point L1839(lines 1834 1842) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (not (= 0 |ULTIMATE.start_is_queue_empty_#res|)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,318 INFO L439 ceAbstractionStarter]: At program point L452(lines 432 454) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1377(lines 1377 1385) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1357) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1377-2(lines 1377 1385) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1377-4(lines 1377 1385) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1377-6(lines 1377 1385) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1377-8(lines 1377 1385) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L443 ceAbstractionStarter]: For program point L1312(lines 1312 1323) no Hoare annotation was computed. [2019-10-22 11:26:18,319 INFO L439 ceAbstractionStarter]: At program point L1246(lines 1229 1252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,319 INFO L439 ceAbstractionStarter]: At program point L1246-1(lines 1229 1252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,320 INFO L439 ceAbstractionStarter]: At program point L1246-2(lines 1229 1252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 130) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L439 ceAbstractionStarter]: At program point L1246-3(lines 1229 1252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,320 INFO L439 ceAbstractionStarter]: At program point L1246-4(lines 1229 1252) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 194) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L1776(lines 1776 1783) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L1776-2(lines 1776 1783) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1462) no Hoare annotation was computed. [2019-10-22 11:26:18,320 INFO L443 ceAbstractionStarter]: For program point L1380(lines 1380 1384) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1380-3(lines 1380 1384) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1380-6(lines 1380 1384) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1380-9(lines 1380 1384) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1380-12(lines 1380 1384) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1657) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1645-2(lines 1645 1657) no Hoare annotation was computed. [2019-10-22 11:26:18,321 INFO L443 ceAbstractionStarter]: For program point L1645-4(lines 1645 1657) no Hoare annotation was computed. [2019-10-22 11:26:18,322 INFO L443 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-10-22 11:26:18,322 INFO L443 ceAbstractionStarter]: For program point L1316(lines 1316 1322) no Hoare annotation was computed. [2019-10-22 11:26:18,322 INFO L439 ceAbstractionStarter]: At program point L1515(lines 1468 1521) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,322 INFO L439 ceAbstractionStarter]: At program point L1515-1(lines 1468 1521) the Hoare annotation is: false [2019-10-22 11:26:18,322 INFO L443 ceAbstractionStarter]: For program point L1648(lines 1648 1656) no Hoare annotation was computed. [2019-10-22 11:26:18,322 INFO L443 ceAbstractionStarter]: For program point L1648-2(lines 1648 1656) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L1648-4(lines 1648 1656) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L1186(lines 1186 1202) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L1186-1(lines 1186 1202) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1457) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L439 ceAbstractionStarter]: At program point L196(lines 186 242) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,323 INFO L439 ceAbstractionStarter]: At program point L1848(lines 1843 1851) the Hoare annotation is: false [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L2179(lines 2179 2187) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L2179-2(lines 2179 2187) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:26:18,323 INFO L443 ceAbstractionStarter]: For program point L2179-4(lines 2179 2187) no Hoare annotation was computed. [2019-10-22 11:26:18,324 INFO L443 ceAbstractionStarter]: For program point L2179-6(lines 2179 2187) no Hoare annotation was computed. [2019-10-22 11:26:18,324 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1655) no Hoare annotation was computed. [2019-10-22 11:26:18,324 INFO L439 ceAbstractionStarter]: At program point L1651-2(lines 1 2825) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:18,324 INFO L443 ceAbstractionStarter]: For program point L1651-3(lines 1651 1655) no Hoare annotation was computed. [2019-10-22 11:26:18,324 INFO L439 ceAbstractionStarter]: At program point L1651-5(lines 1 2825) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:26:18,324 INFO L443 ceAbstractionStarter]: For program point L1651-6(lines 1651 1655) no Hoare annotation was computed. [2019-10-22 11:26:18,324 INFO L439 ceAbstractionStarter]: At program point L1651-8(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 456 ULTIMATE.start_setClientPrivateKey_~value) (= ULTIMATE.start_setClientPrivateKey_~handle 2) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,324 INFO L443 ceAbstractionStarter]: For program point L1387(lines 1387 1399) no Hoare annotation was computed. [2019-10-22 11:26:18,325 INFO L439 ceAbstractionStarter]: At program point L1387-1(lines 1361 1404) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,325 INFO L443 ceAbstractionStarter]: For program point L1387-2(lines 1387 1399) no Hoare annotation was computed. [2019-10-22 11:26:18,325 INFO L439 ceAbstractionStarter]: At program point L1387-3(lines 1361 1404) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,325 INFO L443 ceAbstractionStarter]: For program point L1387-4(lines 1387 1399) no Hoare annotation was computed. [2019-10-22 11:26:18,325 INFO L439 ceAbstractionStarter]: At program point L1387-5(lines 1361 1404) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,326 INFO L443 ceAbstractionStarter]: For program point L1387-6(lines 1387 1399) no Hoare annotation was computed. [2019-10-22 11:26:18,326 INFO L439 ceAbstractionStarter]: At program point L132(lines 119 247) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,326 INFO L439 ceAbstractionStarter]: At program point L1387-7(lines 1361 1404) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,326 INFO L443 ceAbstractionStarter]: For program point L1387-8(lines 1387 1399) no Hoare annotation was computed. [2019-10-22 11:26:18,326 INFO L439 ceAbstractionStarter]: At program point L1387-9(lines 1361 1404) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,326 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1396) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1388-2(lines 1388 1396) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1388-4(lines 1388 1396) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1388-6(lines 1388 1396) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1201) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1190-1(lines 1190 1201) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1388-8(lines 1388 1396) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1257(lines 1257 1269) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1257-2(lines 1257 1269) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2186) no Hoare annotation was computed. [2019-10-22 11:26:18,327 INFO L443 ceAbstractionStarter]: For program point L1257-4(lines 1257 1269) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L439 ceAbstractionStarter]: At program point L2182-2(lines 2175 2190) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L1257-6(lines 1257 1269) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L2182-3(lines 2182 2186) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L1257-8(lines 1257 1269) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L2182-6(lines 2182 2186) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L439 ceAbstractionStarter]: At program point L2182-8(lines 2175 2190) the Hoare annotation is: false [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L2182-9(lines 2182 2186) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 472) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L446 ceAbstractionStarter]: At program point L465-1(lines 465 472) the Hoare annotation is: true [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 208) no Hoare annotation was computed. [2019-10-22 11:26:18,328 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1728) no Hoare annotation was computed. [2019-10-22 11:26:18,329 INFO L439 ceAbstractionStarter]: At program point L1721-1(lines 1721 1728) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,329 INFO L443 ceAbstractionStarter]: For program point L1721-2(lines 1721 1728) no Hoare annotation was computed. [2019-10-22 11:26:18,329 INFO L439 ceAbstractionStarter]: At program point L1721-3(lines 1721 1728) the Hoare annotation is: false [2019-10-22 11:26:18,329 INFO L443 ceAbstractionStarter]: For program point L1391(lines 1391 1395) no Hoare annotation was computed. [2019-10-22 11:26:18,329 INFO L443 ceAbstractionStarter]: For program point L1325(lines 1325 1356) no Hoare annotation was computed. [2019-10-22 11:26:18,329 INFO L443 ceAbstractionStarter]: For program point L1391-3(lines 1391 1395) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1391-6(lines 1391 1395) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1391-9(lines 1391 1395) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1391-12(lines 1391 1395) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1337) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1260(lines 1260 1268) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1260-2(lines 1260 1268) no Hoare annotation was computed. [2019-10-22 11:26:18,330 INFO L443 ceAbstractionStarter]: For program point L1194(lines 1194 1200) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1194-1(lines 1194 1200) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1260-4(lines 1260 1268) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1260-6(lines 1260 1268) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1260-8(lines 1260 1268) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1526(lines 1526 1562) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 1526 1562) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1526-2(lines 1526 1562) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1526-3(lines 1526 1562) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1526-4(lines 1526 1562) no Hoare annotation was computed. [2019-10-22 11:26:18,331 INFO L439 ceAbstractionStarter]: At program point L1857(lines 1852 1860) the Hoare annotation is: false [2019-10-22 11:26:18,331 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1535) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L439 ceAbstractionStarter]: At program point L1461(lines 1414 1467) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1527-2(lines 1527 1535) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1527-4(lines 1527 1535) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1527-6(lines 1527 1535) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1263(lines 1263 1267) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1527-8(lines 1527 1535) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L439 ceAbstractionStarter]: At program point L1263-2(lines 1253 1272) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,332 INFO L443 ceAbstractionStarter]: For program point L1263-3(lines 1263 1267) no Hoare annotation was computed. [2019-10-22 11:26:18,332 INFO L439 ceAbstractionStarter]: At program point L1263-5(lines 1253 1272) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,333 INFO L443 ceAbstractionStarter]: For program point L1263-6(lines 1263 1267) no Hoare annotation was computed. [2019-10-22 11:26:18,333 INFO L439 ceAbstractionStarter]: At program point L1263-8(lines 1253 1272) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,333 INFO L443 ceAbstractionStarter]: For program point L1263-9(lines 1263 1267) no Hoare annotation was computed. [2019-10-22 11:26:18,333 INFO L443 ceAbstractionStarter]: For program point L1990(lines 1990 1998) no Hoare annotation was computed. [2019-10-22 11:26:18,333 INFO L439 ceAbstractionStarter]: At program point L1263-11(lines 1253 1272) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L1990-2(lines 1990 1998) no Hoare annotation was computed. [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L1263-12(lines 1263 1267) no Hoare annotation was computed. [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L1990-4(lines 1990 1998) no Hoare annotation was computed. [2019-10-22 11:26:18,334 INFO L439 ceAbstractionStarter]: At program point L1263-14(lines 1253 1272) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L1330(lines 1330 1336) no Hoare annotation was computed. [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L2123-1(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,334 INFO L443 ceAbstractionStarter]: For program point L2123(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L2123-3(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L2123-2(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L2123-5(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L2123-4(lines 2123 2134) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L439 ceAbstractionStarter]: At program point L1199(lines 1182 1205) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,335 INFO L446 ceAbstractionStarter]: At program point L1199-1(lines 1182 1205) the Hoare annotation is: true [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L1530(lines 1530 1534) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L446 ceAbstractionStarter]: At program point L473(lines 455 475) the Hoare annotation is: true [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L1530-3(lines 1530 1534) no Hoare annotation was computed. [2019-10-22 11:26:18,335 INFO L443 ceAbstractionStarter]: For program point L1530-6(lines 1530 1534) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L443 ceAbstractionStarter]: For program point L1530-9(lines 1530 1534) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L443 ceAbstractionStarter]: For program point L1530-12(lines 1530 1534) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L443 ceAbstractionStarter]: For program point L1993(lines 1993 1997) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L439 ceAbstractionStarter]: At program point L1993-2(lines 1986 2001) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,336 INFO L443 ceAbstractionStarter]: For program point L1993-3(lines 1993 1997) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L439 ceAbstractionStarter]: At program point L1993-5(lines 1986 2001) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,336 INFO L443 ceAbstractionStarter]: For program point L1993-6(lines 1993 1997) no Hoare annotation was computed. [2019-10-22 11:26:18,336 INFO L439 ceAbstractionStarter]: At program point L1993-8(lines 1986 2001) the Hoare annotation is: false [2019-10-22 11:26:18,336 INFO L439 ceAbstractionStarter]: At program point L210(lines 197 241) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 417) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127-1(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127-3(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127-2(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127-5(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,337 INFO L443 ceAbstractionStarter]: For program point L2127-4(lines 2127 2133) no Hoare annotation was computed. [2019-10-22 11:26:18,338 INFO L439 ceAbstractionStarter]: At program point L146(lines 133 246) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,338 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2690) no Hoare annotation was computed. [2019-10-22 11:26:18,338 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 222) no Hoare annotation was computed. [2019-10-22 11:26:18,338 INFO L443 ceAbstractionStarter]: For program point L1537(lines 1537 1561) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L443 ceAbstractionStarter]: For program point L1537-1(lines 1537 1561) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L443 ceAbstractionStarter]: For program point L1537-2(lines 1537 1561) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L443 ceAbstractionStarter]: For program point L1537-3(lines 1537 1561) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L443 ceAbstractionStarter]: For program point L1537-4(lines 1537 1561) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L443 ceAbstractionStarter]: For program point L1339(lines 1339 1355) no Hoare annotation was computed. [2019-10-22 11:26:18,339 INFO L439 ceAbstractionStarter]: At program point L2132(lines 2119 2137) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,339 INFO L439 ceAbstractionStarter]: At program point L2132-2(lines 2119 2137) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,339 INFO L439 ceAbstractionStarter]: At program point L2132-1(lines 2119 2137) the Hoare annotation is: false [2019-10-22 11:26:18,339 INFO L439 ceAbstractionStarter]: At program point L2132-4(lines 2119 2137) the Hoare annotation is: false [2019-10-22 11:26:18,339 INFO L446 ceAbstractionStarter]: At program point L2132-3(lines 2119 2137) the Hoare annotation is: true [2019-10-22 11:26:18,340 INFO L446 ceAbstractionStarter]: At program point L2132-5(lines 2119 2137) the Hoare annotation is: true [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 1546) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1538-2(lines 1538 1546) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1518) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 1472 1518) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1538-4(lines 1538 1546) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1340(lines 1340 1351) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1538-6(lines 1538 1546) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1538-8(lines 1538 1546) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 158) no Hoare annotation was computed. [2019-10-22 11:26:18,340 INFO L439 ceAbstractionStarter]: At program point L2794(lines 2783 2797) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_email_to0~0 2) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= |ULTIMATE.start_createEmail_#res| 1) (= 0 (+ ~mail_is_sensitive~0 1)) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,340 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1484) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L1473-1(lines 1473 1484) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L1870(lines 1870 1880) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L1870-1(lines 1870 1880) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L1210-2(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,341 INFO L443 ceAbstractionStarter]: For program point L87(lines 86 250) no Hoare annotation was computed. [2019-10-22 11:26:18,342 INFO L443 ceAbstractionStarter]: For program point L1210-4(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,342 INFO L443 ceAbstractionStarter]: For program point L1210-6(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,342 INFO L443 ceAbstractionStarter]: For program point L1210-8(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,342 INFO L443 ceAbstractionStarter]: For program point L1210-10(lines 1210 1222) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2690) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1541(lines 1541 1545) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1541-3(lines 1541 1545) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1541-6(lines 1541 1545) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1541-9(lines 1541 1545) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1541-12(lines 1541 1545) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 92) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1350) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1483) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1477-1(lines 1477 1483) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1213(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,343 INFO L443 ceAbstractionStarter]: For program point L1213-2(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1213-4(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1213-6(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1213-8(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1213-10(lines 1213 1221) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1874(lines 1874 1879) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L1874-1(lines 1874 1879) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L439 ceAbstractionStarter]: At program point L1742(lines 1811 1823) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,344 INFO L439 ceAbstractionStarter]: At program point L224(lines 211 240) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L2008(lines 2008 2019) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L2008-1(lines 2008 2019) no Hoare annotation was computed. [2019-10-22 11:26:18,344 INFO L443 ceAbstractionStarter]: For program point L2008-2(lines 2008 2019) no Hoare annotation was computed. [2019-10-22 11:26:18,345 INFO L443 ceAbstractionStarter]: For program point L2008-3(lines 2008 2019) no Hoare annotation was computed. [2019-10-22 11:26:18,345 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,345 INFO L439 ceAbstractionStarter]: At program point L1216-2(lines 1 2825) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:18,345 INFO L443 ceAbstractionStarter]: For program point L1216-3(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,345 INFO L439 ceAbstractionStarter]: At program point L1216-5(lines 1 2825) the Hoare annotation is: (and (= 1 ~queue_empty~0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (= 456 ULTIMATE.start_setClientPrivateKey_~value) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= ULTIMATE.start_setClientPrivateKey_~handle 2) (not (= ~__ste_email_to0~0 1)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,345 INFO L443 ceAbstractionStarter]: For program point L1216-6(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,346 INFO L439 ceAbstractionStarter]: At program point L1216-8(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= 2 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 0 (+ ~mail_is_sensitive~0 1)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,346 INFO L443 ceAbstractionStarter]: For program point L1216-9(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,346 INFO L439 ceAbstractionStarter]: At program point L1216-11(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,346 INFO L443 ceAbstractionStarter]: For program point L1216-12(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,346 INFO L439 ceAbstractionStarter]: At program point L1216-14(lines 578 587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L1216-15(lines 1216 1220) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L439 ceAbstractionStarter]: At program point L1216-17(lines 568 577) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,347 INFO L439 ceAbstractionStarter]: At program point L160(lines 147 245) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L2142(lines 2142 2150) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 249) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L2142-2(lines 2142 2150) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L2142-4(lines 2142 2150) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L2142-6(lines 2142 2150) no Hoare annotation was computed. [2019-10-22 11:26:18,347 INFO L443 ceAbstractionStarter]: For program point L1548(lines 1548 1560) no Hoare annotation was computed. [2019-10-22 11:26:18,348 INFO L439 ceAbstractionStarter]: At program point L1548-1(lines 1522 1565) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,348 INFO L443 ceAbstractionStarter]: For program point L1548-2(lines 1548 1560) no Hoare annotation was computed. [2019-10-22 11:26:18,348 INFO L439 ceAbstractionStarter]: At program point L1548-3(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,348 INFO L443 ceAbstractionStarter]: For program point L1548-4(lines 1548 1560) no Hoare annotation was computed. [2019-10-22 11:26:18,348 INFO L439 ceAbstractionStarter]: At program point L1548-5(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,348 INFO L443 ceAbstractionStarter]: For program point L1548-6(lines 1548 1560) no Hoare annotation was computed. [2019-10-22 11:26:18,348 INFO L439 ceAbstractionStarter]: At program point L1548-7(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,348 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1294) no Hoare annotation was computed. [2019-10-22 11:26:18,348 INFO L443 ceAbstractionStarter]: For program point L1548-8(lines 1548 1560) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1284-1(lines 1284 1294) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L439 ceAbstractionStarter]: At program point L1548-9(lines 1 2825) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1294) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1284-3(lines 1284 1294) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1284-4(lines 1284 1294) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1549(lines 1549 1557) no Hoare annotation was computed. [2019-10-22 11:26:18,349 INFO L443 ceAbstractionStarter]: For program point L1549-2(lines 1549 1557) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L1549-4(lines 1549 1557) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L1549-6(lines 1549 1557) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L1549-8(lines 1549 1557) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L2012(lines 2012 2018) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L2012-1(lines 2012 2018) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L2012-2(lines 2012 2018) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L2012-3(lines 2012 2018) no Hoare annotation was computed. [2019-10-22 11:26:18,350 INFO L443 ceAbstractionStarter]: For program point L1418(lines 1418 1464) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L439 ceAbstractionStarter]: At program point L229-1(lines 86 250) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L2145(lines 2145 2149) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L2145-3(lines 2145 2149) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L439 ceAbstractionStarter]: At program point L2145-5(lines 2138 2153) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L2145-6(lines 2145 2149) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L2145-9(lines 2145 2149) no Hoare annotation was computed. [2019-10-22 11:26:18,351 INFO L446 ceAbstractionStarter]: At program point L2145-11(lines 2138 2153) the Hoare annotation is: true [2019-10-22 11:26:18,351 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1430) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L439 ceAbstractionStarter]: At program point L296(lines 1 2825) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= 1 ~queue_empty~0) (not (= ~rjh~0 1)) (= 0 (+ ~mail_is_sensitive~0 1)) (= 0 ~__ste_Client_Keyring0_User0~0) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 105) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L439 ceAbstractionStarter]: At program point L1882(lines 1861 1885) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_getClientPrivateKey_~handle 2) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 1 ULTIMATE.start_setEmailTo_~handle) (= ULTIMATE.start_setEmailTo_~value 2) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= 1 ULTIMATE.start_outgoing_~msg) (= ~__ste_email_to0~0 2) (= ULTIMATE.start_mail_~msg 1) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= |ULTIMATE.start_createEmail_#res| 1) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (= 2 ULTIMATE.start_createEmail_~to) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:26:18,352 INFO L446 ceAbstractionStarter]: At program point L1882-1(lines 1861 1885) the Hoare annotation is: true [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L2807(lines 2807 2822) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L2807-2(lines 2807 2822) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L1552(lines 1552 1556) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L439 ceAbstractionStarter]: At program point L495(lines 476 497) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L1486(lines 1486 1517) no Hoare annotation was computed. [2019-10-22 11:26:18,352 INFO L443 ceAbstractionStarter]: For program point L1552-3(lines 1552 1556) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L1486-1(lines 1486 1517) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L439 ceAbstractionStarter]: At program point L1354(lines 1307 1360) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 1 ~queue_empty~0) (= 0 ULTIMATE.start_test_~op1~0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= ~queue_empty~0 ULTIMATE.start_main_~tmp~2) (not (= ULTIMATE.start_setClientId_~handle 2)) (= 0 (+ ~mail_is_sensitive~0 1)) (= |ULTIMATE.start_valid_product_#res| ~queue_empty~0) (not (= ~__ste_email_to0~0 1)) (not (= 1 ULTIMATE.start_setup_chuck_~chuck___0)) (= ~rjh~0 2)) [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L1552-6(lines 1552 1556) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L1552-9(lines 1552 1556) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 169) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L1552-12(lines 1552 1556) no Hoare annotation was computed. [2019-10-22 11:26:18,353 INFO L443 ceAbstractionStarter]: For program point L1487(lines 1487 1498) no Hoare annotation was computed. [2019-10-22 11:26:18,354 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 1487 1498) no Hoare annotation was computed. [2019-10-22 11:26:18,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:18 BoogieIcfgContainer [2019-10-22 11:26:18,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:18,402 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:18,402 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:18,403 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:18,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:56" (3/4) ... [2019-10-22 11:26:18,406 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:18,432 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2019-10-22 11:26:18,434 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2019-10-22 11:26:18,435 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:26:18,437 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:18,439 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:18,468 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) [2019-10-22 11:26:18,468 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && !(handle == 2)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) [2019-10-22 11:26:18,468 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) [2019-10-22 11:26:18,469 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && rjh == handle) && handle == rjh___0) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1)) && rjh == 2 [2019-10-22 11:26:18,469 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == queue_empty && rjh == handle) && 456 == value) && handle == rjh___0) && handle == 2) && !(__ste_email_to0 == 1)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 [2019-10-22 11:26:18,469 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && 456 == value) && handle == 2) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 [2019-10-22 11:26:18,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 [2019-10-22 11:26:18,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 [2019-10-22 11:26:18,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,470 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,472 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,473 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,473 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,474 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,475 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,475 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,475 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,475 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,476 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,481 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,482 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,482 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,482 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 [2019-10-22 11:26:18,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,484 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && queue_empty == tmp) && \result == 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,485 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,485 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,485 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,486 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,486 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && !(0 == \result)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,486 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,486 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,486 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 [2019-10-22 11:26:18,635 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ef382e6-5ae5-4b43-8f9c-8d0a7c214cdc/bin/utaipan/witness.graphml [2019-10-22 11:26:18,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:18,637 INFO L168 Benchmark]: Toolchain (without parser) took 25457.64 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 888.1 MB). Free memory was 937.8 MB in the beginning and 1.6 GB in the end (delta: -659.1 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,637 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:18,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 976.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,638 INFO L168 Benchmark]: Boogie Preprocessor took 108.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,639 INFO L168 Benchmark]: RCFGBuilder took 1836.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.3 MB in the end (delta: 174.6 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,639 INFO L168 Benchmark]: TraceAbstraction took 22147.05 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 716.7 MB). Free memory was 926.3 MB in the beginning and 1.6 GB in the end (delta: -718.1 MB). Peak memory consumption was 799.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,639 INFO L168 Benchmark]: Witness Printer took 233.34 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:18,641 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 976.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 152.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1836.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 926.3 MB in the end (delta: 174.6 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22147.05 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 716.7 MB). Free memory was 926.3 MB in the beginning and 1.6 GB in the end (delta: -718.1 MB). Peak memory consumption was 799.9 MB. Max. memory is 11.5 GB. * Witness Printer took 233.34 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2690]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2690]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1986]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1617]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1617]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1986]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1986]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && !(__ste_email_to0 == 1)) && 1 == msg) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1834]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && !(0 == \result)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1361]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2156]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1361]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2023]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2783]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && __ste_email_to0 == 2) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1361]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1361]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1811]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && rjh == handle) && handle == rjh___0) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 - InvariantResult [Line: 1843]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && 456 == value) && handle == 2) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 - InvariantResult [Line: 1468]: Loop Invariant Derived loop invariant: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1522]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1361]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1307]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1468]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2175]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && 1 == queue_empty) && !(rjh == 1)) && !(handle == 2)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((1 == queue_empty && rjh == handle) && 456 == value) && handle == rjh___0) && handle == 2) && !(__ste_email_to0 == 1)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(2 == chuck___0)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && !(handle == 1)) && 0 == __ste_Client_Keyring0_User0) && \result == queue_empty) && rjh == 2 - InvariantResult [Line: 2175]: Loop Invariant Derived loop invariant: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && !(handle == 2)) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1721]: Loop Invariant Derived loop invariant: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && queue_empty == tmp) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1721]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: ((((((((((((((((handle == chuck___0 && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && 2 == \result) && queue_empty == tmp) && \result == 1) && 0 == mail_is_sensitive + 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1414]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && queue_empty == tmp) && \result == 1) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1273]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2800]: Loop Invariant Derived loop invariant: (((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 1 == queue_empty) && 0 == op1) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 2800]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == msg && handle == chuck___0) && 1 == queue_empty) && 1 == handle) && handle == 2) && 2 == rjh___0) && !(handle == 2)) && 1 == handle) && value == 2) && !(1 == chuck___0)) && 1 == msg) && __ste_email_to0 == 2) && msg == 1) && 2 == \result) && \result == 1) && queue_empty == tmp) && 2 == to) && \result == queue_empty) && 1 == msg) && rjh == 2 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 1229]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && 1 == queue_empty) && 2 == rjh___0) && queue_empty == tmp) && !(handle == 2)) && 0 == mail_is_sensitive + 1) && \result == queue_empty) && !(__ste_email_to0 == 1)) && !(1 == chuck___0)) && rjh == 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 381 locations, 2 error locations. Result: SAFE, OverallTime: 22.0s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.0s, HoareTripleCheckerStatistics: 12617 SDtfs, 23013 SDslu, 23919 SDs, 0 SdLazy, 892 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2643occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 4144 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 93 LocationsWithAnnotation, 93 PreInvPairs, 684 NumberOfFragments, 3235 HoareAnnotationTreeSize, 93 FomulaSimplifications, 923741 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 93 FomulaSimplificationsInter, 628792 FormulaSimplificationTreeSizeReductionInter, 10.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1107 ConstructedInterpolants, 0 QuantifiedInterpolants, 149561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...