./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec8_product12_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/email_spec8_product12_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1564ec6b4d8b9d1c0e23b5ae3619ad45b11fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:44:24,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:44:24,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:44:24,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:44:24,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:44:24,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:44:24,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:44:24,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:44:24,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:44:24,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:44:24,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:44:24,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:44:24,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:44:24,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:44:24,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:44:24,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:44:24,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:44:24,159 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:44:24,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:44:24,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:44:24,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:44:24,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:44:24,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:44:24,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:44:24,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:44:24,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:44:24,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:44:24,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:44:24,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:44:24,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:44:24,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:44:24,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:44:24,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:44:24,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:44:24,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:44:24,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:44:24,178 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:44:24,203 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:44:24,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:44:24,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:44:24,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:44:24,208 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:44:24,208 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:44:24,208 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:44:24,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:44:24,209 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:44:24,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:44:24,212 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:44:24,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:44:24,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:44:24,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:44:24,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:44:24,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:44:24,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:44:24,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:44:24,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:44:24,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:44:24,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:44:24,216 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:44:24,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:44:24,216 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 68e1564ec6b4d8b9d1c0e23b5ae3619ad45b11fd [2019-01-12 14:44:24,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:44:24,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:44:24,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:44:24,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:44:24,282 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:44:24,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec8_product12_true-unreach-call_true-termination.cil.c [2019-01-12 14:44:24,336 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38797652/4593a82755fc4c9f8240e6583a417bdf/FLAG1cea5a4d8 [2019-01-12 14:44:24,896 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:44:24,897 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec8_product12_true-unreach-call_true-termination.cil.c [2019-01-12 14:44:24,928 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38797652/4593a82755fc4c9f8240e6583a417bdf/FLAG1cea5a4d8 [2019-01-12 14:44:25,139 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38797652/4593a82755fc4c9f8240e6583a417bdf [2019-01-12 14:44:25,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:44:25,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:44:25,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:44:25,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:44:25,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:44:25,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:44:25" (1/1) ... [2019-01-12 14:44:25,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b00c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:25, skipping insertion in model container [2019-01-12 14:44:25,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:44:25" (1/1) ... [2019-01-12 14:44:25,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:44:25,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:44:25,890 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:44:25,908 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:44:26,128 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:44:26,214 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:44:26,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26 WrapperNode [2019-01-12 14:44:26,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:44:26,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:44:26,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:44:26,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:44:26,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:44:26,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:44:26,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:44:26,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:44:26,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... [2019-01-12 14:44:26,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:44:26,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:44:26,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:44:26,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:44:26,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:44:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-12 14:44:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:44:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:44:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:44:26,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:44:29,806 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:44:29,807 INFO L286 CfgBuilder]: Removed 231 assue(true) statements. [2019-01-12 14:44:29,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:44:29 BoogieIcfgContainer [2019-01-12 14:44:29,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:44:29,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:44:29,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:44:29,813 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:44:29,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:44:25" (1/3) ... [2019-01-12 14:44:29,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96a3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:44:29, skipping insertion in model container [2019-01-12 14:44:29,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:44:26" (2/3) ... [2019-01-12 14:44:29,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96a3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:44:29, skipping insertion in model container [2019-01-12 14:44:29,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:44:29" (3/3) ... [2019-01-12 14:44:29,816 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product12_true-unreach-call_true-termination.cil.c [2019-01-12 14:44:29,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:44:29,835 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 14:44:29,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 14:44:29,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:44:29,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:44:29,888 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:44:29,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:44:29,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:44:29,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:44:29,889 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:44:29,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:44:29,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:44:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states. [2019-01-12 14:44:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 14:44:29,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:29,929 INFO L402 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-01-12 14:44:29,931 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:29,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1406579473, now seen corresponding path program 1 times [2019-01-12 14:44:29,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:30,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:30,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:30,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:30,382 INFO L87 Difference]: Start difference. First operand 383 states. Second operand 3 states. [2019-01-12 14:44:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:30,639 INFO L93 Difference]: Finished difference Result 1114 states and 1961 transitions. [2019-01-12 14:44:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:30,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-01-12 14:44:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:30,682 INFO L225 Difference]: With dead ends: 1114 [2019-01-12 14:44:30,683 INFO L226 Difference]: Without dead ends: 678 [2019-01-12 14:44:30,693 INFO L631 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-01-12 14:44:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-01-12 14:44:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 348. [2019-01-12 14:44:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 608 transitions. [2019-01-12 14:44:30,782 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 608 transitions. Word has length 41 [2019-01-12 14:44:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:30,782 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 608 transitions. [2019-01-12 14:44:30,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 608 transitions. [2019-01-12 14:44:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 14:44:30,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:30,786 INFO L402 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-01-12 14:44:30,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1229064159, now seen corresponding path program 1 times [2019-01-12 14:44:30,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:44:31,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:44:31,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:44:31,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:31,108 INFO L87 Difference]: Start difference. First operand 348 states and 608 transitions. Second operand 5 states. [2019-01-12 14:44:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:31,643 INFO L93 Difference]: Finished difference Result 993 states and 1740 transitions. [2019-01-12 14:44:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:44:31,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-12 14:44:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:31,652 INFO L225 Difference]: With dead ends: 993 [2019-01-12 14:44:31,652 INFO L226 Difference]: Without dead ends: 664 [2019-01-12 14:44:31,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:44:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-01-12 14:44:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 348. [2019-01-12 14:44:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 607 transitions. [2019-01-12 14:44:31,683 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 607 transitions. Word has length 43 [2019-01-12 14:44:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:31,684 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 607 transitions. [2019-01-12 14:44:31,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:44:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 607 transitions. [2019-01-12 14:44:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 14:44:31,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:31,688 INFO L402 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-01-12 14:44:31,688 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:31,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1119354482, now seen corresponding path program 1 times [2019-01-12 14:44:31,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:31,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:31,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:31,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:31,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:31,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:31,860 INFO L87 Difference]: Start difference. First operand 348 states and 607 transitions. Second operand 3 states. [2019-01-12 14:44:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:31,976 INFO L93 Difference]: Finished difference Result 678 states and 1188 transitions. [2019-01-12 14:44:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:31,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-12 14:44:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:31,984 INFO L225 Difference]: With dead ends: 678 [2019-01-12 14:44:31,984 INFO L226 Difference]: Without dead ends: 353 [2019-01-12 14:44:31,985 INFO L631 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-01-12 14:44:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-12 14:44:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 348. [2019-01-12 14:44:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 606 transitions. [2019-01-12 14:44:32,013 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 606 transitions. Word has length 44 [2019-01-12 14:44:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:32,013 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 606 transitions. [2019-01-12 14:44:32,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 606 transitions. [2019-01-12 14:44:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:44:32,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:32,016 INFO L402 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-01-12 14:44:32,016 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash 529516012, now seen corresponding path program 1 times [2019-01-12 14:44:32,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:32,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:32,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:32,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:32,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:32,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:32,152 INFO L87 Difference]: Start difference. First operand 348 states and 606 transitions. Second operand 3 states. [2019-01-12 14:44:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:32,292 INFO L93 Difference]: Finished difference Result 688 states and 1201 transitions. [2019-01-12 14:44:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:32,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-01-12 14:44:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:32,298 INFO L225 Difference]: With dead ends: 688 [2019-01-12 14:44:32,298 INFO L226 Difference]: Without dead ends: 348 [2019-01-12 14:44:32,299 INFO L631 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-01-12 14:44:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-01-12 14:44:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-01-12 14:44:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 604 transitions. [2019-01-12 14:44:32,317 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 604 transitions. Word has length 45 [2019-01-12 14:44:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 604 transitions. [2019-01-12 14:44:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 604 transitions. [2019-01-12 14:44:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 14:44:32,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:32,319 INFO L402 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-01-12 14:44:32,319 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1405066185, now seen corresponding path program 1 times [2019-01-12 14:44:32,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:32,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:32,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:32,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:32,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:32,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:44:32,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:44:32,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:44:32,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:32,596 INFO L87 Difference]: Start difference. First operand 348 states and 604 transitions. Second operand 5 states. [2019-01-12 14:44:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:33,388 INFO L93 Difference]: Finished difference Result 983 states and 1720 transitions. [2019-01-12 14:44:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:44:33,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-12 14:44:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:33,395 INFO L225 Difference]: With dead ends: 983 [2019-01-12 14:44:33,395 INFO L226 Difference]: Without dead ends: 662 [2019-01-12 14:44:33,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:44:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-01-12 14:44:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 348. [2019-01-12 14:44:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 603 transitions. [2019-01-12 14:44:33,430 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 603 transitions. Word has length 46 [2019-01-12 14:44:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:33,431 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 603 transitions. [2019-01-12 14:44:33,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:44:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 603 transitions. [2019-01-12 14:44:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 14:44:33,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:33,439 INFO L402 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-01-12 14:44:33,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:33,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2127825844, now seen corresponding path program 1 times [2019-01-12 14:44:33,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:33,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:33,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:33,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:33,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:44:33,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:44:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:44:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:33,746 INFO L87 Difference]: Start difference. First operand 348 states and 603 transitions. Second operand 5 states. [2019-01-12 14:44:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:34,237 INFO L93 Difference]: Finished difference Result 988 states and 1725 transitions. [2019-01-12 14:44:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:44:34,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-12 14:44:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:34,242 INFO L225 Difference]: With dead ends: 988 [2019-01-12 14:44:34,242 INFO L226 Difference]: Without dead ends: 667 [2019-01-12 14:44:34,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:44:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-01-12 14:44:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 348. [2019-01-12 14:44:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-12 14:44:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 602 transitions. [2019-01-12 14:44:34,272 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 602 transitions. Word has length 47 [2019-01-12 14:44:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:34,273 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 602 transitions. [2019-01-12 14:44:34,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:44:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 602 transitions. [2019-01-12 14:44:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:44:34,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:34,274 INFO L402 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-01-12 14:44:34,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash 491431836, now seen corresponding path program 1 times [2019-01-12 14:44:34,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:34,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:34,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:34,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:34,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:34,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:34,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:34,413 INFO L87 Difference]: Start difference. First operand 348 states and 602 transitions. Second operand 3 states. [2019-01-12 14:44:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:34,510 INFO L93 Difference]: Finished difference Result 462 states and 787 transitions. [2019-01-12 14:44:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:34,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-01-12 14:44:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:34,519 INFO L225 Difference]: With dead ends: 462 [2019-01-12 14:44:34,519 INFO L226 Difference]: Without dead ends: 351 [2019-01-12 14:44:34,520 INFO L631 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-01-12 14:44:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-01-12 14:44:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2019-01-12 14:44:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-12 14:44:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 604 transitions. [2019-01-12 14:44:34,551 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 604 transitions. Word has length 48 [2019-01-12 14:44:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:34,551 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 604 transitions. [2019-01-12 14:44:34,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 604 transitions. [2019-01-12 14:44:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 14:44:34,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:34,554 INFO L402 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-01-12 14:44:34,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1357482402, now seen corresponding path program 1 times [2019-01-12 14:44:34,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:34,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:44:34,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:34,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:34,676 INFO L87 Difference]: Start difference. First operand 350 states and 604 transitions. Second operand 3 states. [2019-01-12 14:44:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:34,781 INFO L93 Difference]: Finished difference Result 936 states and 1636 transitions. [2019-01-12 14:44:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:34,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-01-12 14:44:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:34,787 INFO L225 Difference]: With dead ends: 936 [2019-01-12 14:44:34,787 INFO L226 Difference]: Without dead ends: 617 [2019-01-12 14:44:34,788 INFO L631 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-01-12 14:44:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-12 14:44:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 506. [2019-01-12 14:44:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-01-12 14:44:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 890 transitions. [2019-01-12 14:44:34,829 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 890 transitions. Word has length 54 [2019-01-12 14:44:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:34,832 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 890 transitions. [2019-01-12 14:44:34,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 890 transitions. [2019-01-12 14:44:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 14:44:34,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:34,833 INFO L402 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-01-12 14:44:34,835 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1913867361, now seen corresponding path program 1 times [2019-01-12 14:44:34,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:34,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:35,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:35,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 14:44:35,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:44:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:44:35,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:44:35,193 INFO L87 Difference]: Start difference. First operand 506 states and 890 transitions. Second operand 9 states. [2019-01-12 14:44:36,596 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 14:44:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:38,265 INFO L93 Difference]: Finished difference Result 1553 states and 2649 transitions. [2019-01-12 14:44:38,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:44:38,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-01-12 14:44:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:38,276 INFO L225 Difference]: With dead ends: 1553 [2019-01-12 14:44:38,276 INFO L226 Difference]: Without dead ends: 1462 [2019-01-12 14:44:38,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:44:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-01-12 14:44:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 951. [2019-01-12 14:44:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-12 14:44:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1691 transitions. [2019-01-12 14:44:38,375 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1691 transitions. Word has length 55 [2019-01-12 14:44:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:38,376 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1691 transitions. [2019-01-12 14:44:38,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:44:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1691 transitions. [2019-01-12 14:44:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 14:44:38,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:38,379 INFO L402 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-01-12 14:44:38,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 299135132, now seen corresponding path program 1 times [2019-01-12 14:44:38,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:38,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:38,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:38,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:38,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:44:38,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:44:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:44:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:44:38,575 INFO L87 Difference]: Start difference. First operand 951 states and 1691 transitions. Second operand 4 states. [2019-01-12 14:44:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:39,196 INFO L93 Difference]: Finished difference Result 1930 states and 3346 transitions. [2019-01-12 14:44:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:44:39,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-12 14:44:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:39,205 INFO L225 Difference]: With dead ends: 1930 [2019-01-12 14:44:39,205 INFO L226 Difference]: Without dead ends: 1780 [2019-01-12 14:44:39,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-01-12 14:44:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1472. [2019-01-12 14:44:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-01-12 14:44:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2616 transitions. [2019-01-12 14:44:39,318 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2616 transitions. Word has length 56 [2019-01-12 14:44:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:39,318 INFO L480 AbstractCegarLoop]: Abstraction has 1472 states and 2616 transitions. [2019-01-12 14:44:39,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:44:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2616 transitions. [2019-01-12 14:44:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-12 14:44:39,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:39,321 INFO L402 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-01-12 14:44:39,322 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash -287670882, now seen corresponding path program 1 times [2019-01-12 14:44:39,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:39,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:39,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:44:39,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:44:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:44:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:44:39,428 INFO L87 Difference]: Start difference. First operand 1472 states and 2616 transitions. Second operand 3 states. [2019-01-12 14:44:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:39,562 INFO L93 Difference]: Finished difference Result 1660 states and 2914 transitions. [2019-01-12 14:44:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:44:39,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-01-12 14:44:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:39,573 INFO L225 Difference]: With dead ends: 1660 [2019-01-12 14:44:39,573 INFO L226 Difference]: Without dead ends: 1454 [2019-01-12 14:44:39,574 INFO L631 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-01-12 14:44:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-01-12 14:44:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2019-01-12 14:44:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-01-12 14:44:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2583 transitions. [2019-01-12 14:44:39,718 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2583 transitions. Word has length 56 [2019-01-12 14:44:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 2583 transitions. [2019-01-12 14:44:39,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:44:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2583 transitions. [2019-01-12 14:44:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-12 14:44:39,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:39,724 INFO L402 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-01-12 14:44:39,724 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1551555458, now seen corresponding path program 1 times [2019-01-12 14:44:39,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:39,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:39,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:39,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:44:39,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:44:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:44:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:44:39,898 INFO L87 Difference]: Start difference. First operand 1454 states and 2583 transitions. Second operand 4 states. [2019-01-12 14:44:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:40,117 INFO L93 Difference]: Finished difference Result 1558 states and 2753 transitions. [2019-01-12 14:44:40,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:44:40,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-01-12 14:44:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:40,124 INFO L225 Difference]: With dead ends: 1558 [2019-01-12 14:44:40,124 INFO L226 Difference]: Without dead ends: 1386 [2019-01-12 14:44:40,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-01-12 14:44:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2019-01-12 14:44:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-01-12 14:44:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2469 transitions. [2019-01-12 14:44:40,234 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2469 transitions. Word has length 83 [2019-01-12 14:44:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:40,234 INFO L480 AbstractCegarLoop]: Abstraction has 1386 states and 2469 transitions. [2019-01-12 14:44:40,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:44:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2469 transitions. [2019-01-12 14:44:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-12 14:44:40,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:40,239 INFO L402 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-01-12 14:44:40,239 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash 64522138, now seen corresponding path program 1 times [2019-01-12 14:44:40,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:40,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:40,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:40,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:40,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:40,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 14:44:40,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:44:40,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:44:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:44:40,694 INFO L87 Difference]: Start difference. First operand 1386 states and 2469 transitions. Second operand 10 states. [2019-01-12 14:44:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:41,386 INFO L93 Difference]: Finished difference Result 1956 states and 3380 transitions. [2019-01-12 14:44:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:44:41,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-01-12 14:44:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:41,395 INFO L225 Difference]: With dead ends: 1956 [2019-01-12 14:44:41,395 INFO L226 Difference]: Without dead ends: 1837 [2019-01-12 14:44:41,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-01-12 14:44:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-01-12 14:44:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1404. [2019-01-12 14:44:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-01-12 14:44:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2493 transitions. [2019-01-12 14:44:41,537 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2493 transitions. Word has length 84 [2019-01-12 14:44:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:41,538 INFO L480 AbstractCegarLoop]: Abstraction has 1404 states and 2493 transitions. [2019-01-12 14:44:41,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:44:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2493 transitions. [2019-01-12 14:44:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 14:44:41,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:41,542 INFO L402 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-01-12 14:44:41,542 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2096099641, now seen corresponding path program 1 times [2019-01-12 14:44:41,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:41,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:41,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:44:41,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:44:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:44:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:44:41,707 INFO L87 Difference]: Start difference. First operand 1404 states and 2493 transitions. Second operand 6 states. [2019-01-12 14:44:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:41,996 INFO L93 Difference]: Finished difference Result 2973 states and 5241 transitions. [2019-01-12 14:44:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:44:41,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-01-12 14:44:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:42,006 INFO L225 Difference]: With dead ends: 2973 [2019-01-12 14:44:42,006 INFO L226 Difference]: Without dead ends: 2908 [2019-01-12 14:44:42,008 INFO L631 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-01-12 14:44:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-01-12 14:44:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2673. [2019-01-12 14:44:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2019-01-12 14:44:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4773 transitions. [2019-01-12 14:44:42,199 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4773 transitions. Word has length 85 [2019-01-12 14:44:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:42,200 INFO L480 AbstractCegarLoop]: Abstraction has 2673 states and 4773 transitions. [2019-01-12 14:44:42,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:44:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4773 transitions. [2019-01-12 14:44:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 14:44:42,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:42,206 INFO L402 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-01-12 14:44:42,207 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:42,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1065197571, now seen corresponding path program 1 times [2019-01-12 14:44:42,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:42,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:42,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:42,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:42,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:42,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:44:42,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:44:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:44:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:44:42,389 INFO L87 Difference]: Start difference. First operand 2673 states and 4773 transitions. Second operand 7 states. [2019-01-12 14:44:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:42,845 INFO L93 Difference]: Finished difference Result 3386 states and 5896 transitions. [2019-01-12 14:44:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:44:42,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-12 14:44:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:42,858 INFO L225 Difference]: With dead ends: 3386 [2019-01-12 14:44:42,858 INFO L226 Difference]: Without dead ends: 3174 [2019-01-12 14:44:42,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:44:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2019-01-12 14:44:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2829. [2019-01-12 14:44:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-01-12 14:44:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 5033 transitions. [2019-01-12 14:44:43,042 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 5033 transitions. Word has length 85 [2019-01-12 14:44:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:43,042 INFO L480 AbstractCegarLoop]: Abstraction has 2829 states and 5033 transitions. [2019-01-12 14:44:43,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:44:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 5033 transitions. [2019-01-12 14:44:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 14:44:43,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:43,049 INFO L402 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-01-12 14:44:43,050 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -769812612, now seen corresponding path program 1 times [2019-01-12 14:44:43,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:43,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:43,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:43,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:44:43,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:44:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:44:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:44:43,535 INFO L87 Difference]: Start difference. First operand 2829 states and 5033 transitions. Second operand 7 states. [2019-01-12 14:44:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:44,525 INFO L93 Difference]: Finished difference Result 3788 states and 6540 transitions. [2019-01-12 14:44:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:44:44,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-01-12 14:44:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:44,542 INFO L225 Difference]: With dead ends: 3788 [2019-01-12 14:44:44,542 INFO L226 Difference]: Without dead ends: 3552 [2019-01-12 14:44:44,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:44:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2019-01-12 14:44:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 2853. [2019-01-12 14:44:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2853 states. [2019-01-12 14:44:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 5068 transitions. [2019-01-12 14:44:44,767 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 5068 transitions. Word has length 85 [2019-01-12 14:44:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:44,767 INFO L480 AbstractCegarLoop]: Abstraction has 2853 states and 5068 transitions. [2019-01-12 14:44:44,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:44:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 5068 transitions. [2019-01-12 14:44:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-12 14:44:44,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:44,775 INFO L402 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] [2019-01-12 14:44:44,775 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash -200799019, now seen corresponding path program 1 times [2019-01-12 14:44:44,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:44,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:44,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:44,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:45,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:45,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 14:44:45,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:44:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:44:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:44:45,021 INFO L87 Difference]: Start difference. First operand 2853 states and 5068 transitions. Second operand 9 states. [2019-01-12 14:44:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:45,699 INFO L93 Difference]: Finished difference Result 3360 states and 5857 transitions. [2019-01-12 14:44:45,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:44:45,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-01-12 14:44:45,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:45,714 INFO L225 Difference]: With dead ends: 3360 [2019-01-12 14:44:45,714 INFO L226 Difference]: Without dead ends: 3214 [2019-01-12 14:44:45,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:44:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-01-12 14:44:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 2895. [2019-01-12 14:44:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-01-12 14:44:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 5122 transitions. [2019-01-12 14:44:45,903 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 5122 transitions. Word has length 86 [2019-01-12 14:44:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:45,903 INFO L480 AbstractCegarLoop]: Abstraction has 2895 states and 5122 transitions. [2019-01-12 14:44:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:44:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 5122 transitions. [2019-01-12 14:44:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-12 14:44:45,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:45,910 INFO L402 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] [2019-01-12 14:44:45,910 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash -292591510, now seen corresponding path program 1 times [2019-01-12 14:44:45,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:45,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:45,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:45,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:45,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:46,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 14:44:46,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:44:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:44:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:44:46,243 INFO L87 Difference]: Start difference. First operand 2895 states and 5122 transitions. Second operand 8 states. [2019-01-12 14:44:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:47,004 INFO L93 Difference]: Finished difference Result 3606 states and 6185 transitions. [2019-01-12 14:44:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 14:44:47,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-01-12 14:44:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:47,013 INFO L225 Difference]: With dead ends: 3606 [2019-01-12 14:44:47,014 INFO L226 Difference]: Without dead ends: 3388 [2019-01-12 14:44:47,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-01-12 14:44:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-01-12 14:44:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 2907. [2019-01-12 14:44:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2019-01-12 14:44:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 5122 transitions. [2019-01-12 14:44:47,192 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 5122 transitions. Word has length 86 [2019-01-12 14:44:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:47,193 INFO L480 AbstractCegarLoop]: Abstraction has 2907 states and 5122 transitions. [2019-01-12 14:44:47,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:44:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 5122 transitions. [2019-01-12 14:44:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-12 14:44:47,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:47,198 INFO L402 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] [2019-01-12 14:44:47,198 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -356866571, now seen corresponding path program 1 times [2019-01-12 14:44:47,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:47,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:44:47,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:44:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:44:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:44:47,341 INFO L87 Difference]: Start difference. First operand 2907 states and 5122 transitions. Second operand 4 states. [2019-01-12 14:44:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:48,150 INFO L93 Difference]: Finished difference Result 5861 states and 10314 transitions. [2019-01-12 14:44:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:44:48,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-01-12 14:44:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:48,160 INFO L225 Difference]: With dead ends: 5861 [2019-01-12 14:44:48,160 INFO L226 Difference]: Without dead ends: 4346 [2019-01-12 14:44:48,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-01-12 14:44:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 2894. [2019-01-12 14:44:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2019-01-12 14:44:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 5105 transitions. [2019-01-12 14:44:48,474 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 5105 transitions. Word has length 86 [2019-01-12 14:44:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:48,474 INFO L480 AbstractCegarLoop]: Abstraction has 2894 states and 5105 transitions. [2019-01-12 14:44:48,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:44:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 5105 transitions. [2019-01-12 14:44:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 14:44:48,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:48,479 INFO L402 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-01-12 14:44:48,479 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743187, now seen corresponding path program 1 times [2019-01-12 14:44:48,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:48,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:48,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:48,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:48,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:44:48,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:44:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:44:48,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:44:48,757 INFO L87 Difference]: Start difference. First operand 2894 states and 5105 transitions. Second operand 6 states. [2019-01-12 14:44:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:49,104 INFO L93 Difference]: Finished difference Result 3204 states and 5589 transitions. [2019-01-12 14:44:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:44:49,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-01-12 14:44:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:49,110 INFO L225 Difference]: With dead ends: 3204 [2019-01-12 14:44:49,111 INFO L226 Difference]: Without dead ends: 3055 [2019-01-12 14:44:49,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:44:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-12 14:44:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2834. [2019-01-12 14:44:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2834 states. [2019-01-12 14:44:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 5018 transitions. [2019-01-12 14:44:49,370 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 5018 transitions. Word has length 87 [2019-01-12 14:44:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:49,371 INFO L480 AbstractCegarLoop]: Abstraction has 2834 states and 5018 transitions. [2019-01-12 14:44:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:44:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 5018 transitions. [2019-01-12 14:44:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 14:44:49,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:44:49,375 INFO L402 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, 1] [2019-01-12 14:44:49,375 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:44:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:44:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1071985214, now seen corresponding path program 1 times [2019-01-12 14:44:49,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:44:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:44:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:44:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:44:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:44:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:44:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:44:49,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:44:49,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:44:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:44:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:44:49,584 INFO L87 Difference]: Start difference. First operand 2834 states and 5018 transitions. Second operand 5 states. [2019-01-12 14:44:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:44:49,786 INFO L93 Difference]: Finished difference Result 2834 states and 5018 transitions. [2019-01-12 14:44:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:44:49,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-01-12 14:44:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:44:49,787 INFO L225 Difference]: With dead ends: 2834 [2019-01-12 14:44:49,787 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:44:49,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:44:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:44:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:44:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:44:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:44:49,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2019-01-12 14:44:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:44:49,791 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:44:49,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:44:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:44:49,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:44:49,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:44:49,902 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-01-12 14:44:50,136 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 186 [2019-01-12 14:44:50,764 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 241 [2019-01-12 14:44:51,189 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:51,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:51,508 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:52,036 WARN L181 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 249 [2019-01-12 14:44:52,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,300 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2019-01-12 14:44:52,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,651 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:52,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:52,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,136 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:53,253 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 181 [2019-01-12 14:44:53,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:53,742 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 224 [2019-01-12 14:44:53,916 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 217 [2019-01-12 14:44:54,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,471 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:54,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,804 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 239 [2019-01-12 14:44:54,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:54,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,029 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 215 [2019-01-12 14:44:55,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:44:55,613 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 34 [2019-01-12 14:44:56,321 WARN L181 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 60 [2019-01-12 14:44:57,719 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 240 DAG size of output: 65 [2019-01-12 14:44:59,150 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:00,726 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:02,623 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 248 DAG size of output: 34 [2019-01-12 14:45:02,728 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:03,066 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:03,770 WARN L181 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 62 [2019-01-12 14:45:03,874 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:03,985 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:05,536 WARN L181 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:05,652 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:05,796 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:05,902 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:06,016 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:06,122 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:06,224 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:07,678 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:08,336 WARN L181 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 56 [2019-01-12 14:45:08,440 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:08,545 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:08,652 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:08,757 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:08,930 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:09,036 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:09,141 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:09,243 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:09,935 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 58 [2019-01-12 14:45:11,424 WARN L181 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 223 DAG size of output: 60 [2019-01-12 14:45:12,912 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 216 DAG size of output: 36 [2019-01-12 14:45:13,641 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 56 [2019-01-12 14:45:13,838 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:14,033 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:14,232 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:14,435 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2019-01-12 14:45:15,103 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 56 [2019-01-12 14:45:15,221 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:15,343 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:15,696 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 34 [2019-01-12 14:45:15,803 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:17,208 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:17,312 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:17,510 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:17,612 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:17,718 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:18,955 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 238 DAG size of output: 65 [2019-01-12 14:45:19,061 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:19,372 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 31 [2019-01-12 14:45:20,933 WARN L181 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 214 DAG size of output: 34 [2019-01-12 14:45:21,132 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:21,358 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:21,463 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:21,568 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:22,139 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 62 [2019-01-12 14:45:22,257 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2019-01-12 14:45:22,262 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 835) no Hoare annotation was computed. [2019-01-12 14:45:22,262 INFO L444 ceAbstractionStarter]: At program point L2678(lines 2631 2684) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ~__ste_email_to0~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 (and .cse4 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse5) .cse6) .cse7 .cse8) (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (not (= ULTIMATE.start_outgoing_~msg 1))) .cse5 .cse6) .cse7 .cse8))) [2019-01-12 14:45:22,263 INFO L444 ceAbstractionStarter]: At program point L2678-1(lines 2631 2684) the Hoare annotation is: false [2019-01-12 14:45:22,264 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 899) no Hoare annotation was computed. [2019-01-12 14:45:22,264 INFO L448 ceAbstractionStarter]: For program point L2811(lines 2811 2819) no Hoare annotation was computed. [2019-01-12 14:45:22,264 INFO L448 ceAbstractionStarter]: For program point L2811-2(lines 2811 2819) no Hoare annotation was computed. [2019-01-12 14:45:22,264 INFO L448 ceAbstractionStarter]: For program point L2811-4(lines 2811 2819) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2349-1(lines 2349 2365) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2349(lines 2349 2365) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2614(lines 2614 2620) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2814(lines 2814 2818) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L444 ceAbstractionStarter]: At program point L2814-2(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~in_encrypted~0 0) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2814-3(lines 2814 2818) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L448 ceAbstractionStarter]: For program point L2814-6(lines 2814 2818) no Hoare annotation was computed. [2019-01-12 14:45:22,265 INFO L444 ceAbstractionStarter]: At program point L2814-5(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= ULTIMATE.start_setClientId_~handle 2) (= ~in_encrypted~0 0) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~__ste_Client_Keyring0_User0~0) (= 0 ~__ste_email_to1~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,265 INFO L444 ceAbstractionStarter]: At program point L2814-8(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_setClientPrivateKey_~value 456) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~queue_empty~0 1) (= 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) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0)) [2019-01-12 14:45:22,266 INFO L448 ceAbstractionStarter]: For program point L2550(lines 2550 2562) no Hoare annotation was computed. [2019-01-12 14:45:22,266 INFO L448 ceAbstractionStarter]: For program point L2550-2(lines 2550 2562) no Hoare annotation was computed. [2019-01-12 14:45:22,266 INFO L444 ceAbstractionStarter]: At program point L2550-1(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,266 INFO L448 ceAbstractionStarter]: For program point L2550-4(lines 2550 2562) no Hoare annotation was computed. [2019-01-12 14:45:22,266 INFO L444 ceAbstractionStarter]: At program point L2550-3(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,266 INFO L448 ceAbstractionStarter]: For program point L2550-6(lines 2550 2562) no Hoare annotation was computed. [2019-01-12 14:45:22,266 INFO L444 ceAbstractionStarter]: At program point L2550-5(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,266 INFO L448 ceAbstractionStarter]: For program point L2550-8(lines 2550 2562) no Hoare annotation was computed. [2019-01-12 14:45:22,266 INFO L444 ceAbstractionStarter]: At program point L2550-7(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,267 INFO L444 ceAbstractionStarter]: At program point L2550-9(lines 2524 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L1626(lines 1626 1648) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L444 ceAbstractionStarter]: At program point L1626-1(lines 1626 1648) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L1626-2(lines 1626 1648) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L451 ceAbstractionStarter]: At program point L1626-3(lines 1626 1648) the Hoare annotation is: true [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2551(lines 2551 2559) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2551-2(lines 2551 2559) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2551-4(lines 2551 2559) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2353-1(lines 2353 2364) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2551-6(lines 2551 2559) no Hoare annotation was computed. [2019-01-12 14:45:22,267 INFO L448 ceAbstractionStarter]: For program point L2353(lines 2353 2364) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2551-8(lines 2551 2559) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2420(lines 2420 2432) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2420-2(lines 2420 2432) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2420-4(lines 2420 2432) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2420-6(lines 2420 2432) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2420-8(lines 2420 2432) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L444 ceAbstractionStarter]: At program point L901(lines 891 947) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,268 INFO L444 ceAbstractionStarter]: At program point L571(lines 551 573) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0)) [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2554(lines 2554 2558) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2488(lines 2488 2519) no Hoare annotation was computed. [2019-01-12 14:45:22,268 INFO L448 ceAbstractionStarter]: For program point L2554-3(lines 2554 2558) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2554-6(lines 2554 2558) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2554-9(lines 2554 2558) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2554-12(lines 2554 2558) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1109) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L444 ceAbstractionStarter]: At program point L837(lines 824 952) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L1630(lines 1630 1645) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L1630-2(lines 1630 1645) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2489(lines 2489 2500) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2423(lines 2423 2431) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2357-1(lines 2357 2363) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2423-2(lines 2423 2431) no Hoare annotation was computed. [2019-01-12 14:45:22,269 INFO L448 ceAbstractionStarter]: For program point L2357(lines 2357 2363) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2423-4(lines 2423 2431) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L1234(lines 1234 1245) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L1234-1(lines 1234 1245) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2423-6(lines 2423 2431) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2423-8(lines 2423 2431) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L444 ceAbstractionStarter]: At program point L1698(lines 1693 1701) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (= |ULTIMATE.start_is_queue_empty_#res| 1) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2689-1(lines 2689 2725) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2689(lines 2689 2725) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2689-3(lines 2689 2725) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2689-2(lines 2689 2725) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L2689-4(lines 2689 2725) no Hoare annotation was computed. [2019-01-12 14:45:22,270 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1108) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L444 ceAbstractionStarter]: At program point L1104-2(lines 1097 1112) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 913) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2690(lines 2690 2698) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L444 ceAbstractionStarter]: At program point L2624(lines 2577 2630) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2690-2(lines 2690 2698) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2690-4(lines 2690 2698) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2690-6(lines 2690 2698) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2426(lines 2426 2430) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L448 ceAbstractionStarter]: For program point L2690-8(lines 2690 2698) no Hoare annotation was computed. [2019-01-12 14:45:22,271 INFO L444 ceAbstractionStarter]: At program point L2426-2(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,272 INFO L448 ceAbstractionStarter]: For program point L2426-3(lines 2426 2430) no Hoare annotation was computed. [2019-01-12 14:45:22,272 INFO L448 ceAbstractionStarter]: For program point L2426-6(lines 2426 2430) no Hoare annotation was computed. [2019-01-12 14:45:22,272 INFO L444 ceAbstractionStarter]: At program point L2426-5(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,272 INFO L444 ceAbstractionStarter]: At program point L2426-8(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,272 INFO L448 ceAbstractionStarter]: For program point L2426-9(lines 2426 2430) no Hoare annotation was computed. [2019-01-12 14:45:22,272 INFO L448 ceAbstractionStarter]: For program point L2426-12(lines 2426 2430) no Hoare annotation was computed. [2019-01-12 14:45:22,272 INFO L444 ceAbstractionStarter]: At program point L2426-11(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,272 INFO L444 ceAbstractionStarter]: At program point L2426-14(lines 2416 2435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,272 INFO L448 ceAbstractionStarter]: For program point L2493(lines 2493 2499) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L1238(lines 1238 1244) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L1238-1(lines 1238 1244) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 849) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1642) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L1635-2(lines 1635 1642) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L444 ceAbstractionStarter]: At program point L2362(lines 2345 2368) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,273 INFO L451 ceAbstractionStarter]: At program point L2362-1(lines 2345 2368) the Hoare annotation is: true [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L2693(lines 2693 2697) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L2693-3(lines 2693 2697) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L2693-6(lines 2693 2697) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L2693-9(lines 2693 2697) no Hoare annotation was computed. [2019-01-12 14:45:22,273 INFO L448 ceAbstractionStarter]: For program point L2693-12(lines 2693 2697) no Hoare annotation was computed. [2019-01-12 14:45:22,274 INFO L444 ceAbstractionStarter]: At program point L1243(lines 1230 1248) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,274 INFO L451 ceAbstractionStarter]: At program point L1243-1(lines 1230 1248) the Hoare annotation is: true [2019-01-12 14:45:22,274 INFO L444 ceAbstractionStarter]: At program point L1707(lines 1702 1710) the Hoare annotation is: false [2019-01-12 14:45:22,274 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 591) no Hoare annotation was computed. [2019-01-12 14:45:22,274 INFO L451 ceAbstractionStarter]: At program point L584-1(lines 584 591) the Hoare annotation is: true [2019-01-12 14:45:22,274 INFO L444 ceAbstractionStarter]: At program point L915(lines 902 946) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,274 INFO L448 ceAbstractionStarter]: For program point L2700(lines 2700 2724) no Hoare annotation was computed. [2019-01-12 14:45:22,274 INFO L448 ceAbstractionStarter]: For program point L2700-2(lines 2700 2724) no Hoare annotation was computed. [2019-01-12 14:45:22,274 INFO L448 ceAbstractionStarter]: For program point L2700-1(lines 2700 2724) no Hoare annotation was computed. [2019-01-12 14:45:22,274 INFO L448 ceAbstractionStarter]: For program point L2700-4(lines 2700 2724) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L1577(lines 1577 1584) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L2700-3(lines 2700 2724) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L444 ceAbstractionStarter]: At program point L1577-1(lines 1577 1584) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ~__ste_email_to0~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 (and .cse4 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse5) .cse6) .cse7 .cse8) (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (not (= ULTIMATE.start_outgoing_~msg 1))) .cse5 .cse6) .cse7 .cse8))) [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2518) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L1577-2(lines 1577 1584) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L444 ceAbstractionStarter]: At program point L1577-3(lines 1577 1584) the Hoare annotation is: false [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L444 ceAbstractionStarter]: At program point L851(lines 838 951) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L2701(lines 2701 2709) no Hoare annotation was computed. [2019-01-12 14:45:22,275 INFO L448 ceAbstractionStarter]: For program point L2635-1(lines 2635 2681) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2701-2(lines 2701 2709) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2635(lines 2635 2681) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2701-4(lines 2701 2709) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2503(lines 2503 2514) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2701-6(lines 2701 2709) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2701-8(lines 2701 2709) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2636(lines 2636 2647) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2636-1(lines 2636 2647) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2373(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2373-2(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2373-4(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,276 INFO L448 ceAbstractionStarter]: For program point L2373-6(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,277 INFO L448 ceAbstractionStarter]: For program point L2373-8(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,277 INFO L448 ceAbstractionStarter]: For program point L2373-10(lines 2373 2385) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 927) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2704(lines 2704 2708) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 747) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2704-3(lines 2704 2708) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2704-6(lines 2704 2708) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2704-9(lines 2704 2708) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2704-12(lines 2704 2708) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L2507(lines 2507 2513) no Hoare annotation was computed. [2019-01-12 14:45:22,283 INFO L448 ceAbstractionStarter]: For program point L856(lines 856 863) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2640(lines 2640 2646) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L451 ceAbstractionStarter]: At program point L592(lines 574 594) the Hoare annotation is: true [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2640-1(lines 2640 2646) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376-2(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376-4(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L1253(lines 1253 1261) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376-6(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L1253-2(lines 1253 1261) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376-8(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L1253-4(lines 1253 1261) no Hoare annotation was computed. [2019-01-12 14:45:22,284 INFO L448 ceAbstractionStarter]: For program point L2376-10(lines 2376 2384) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L448 ceAbstractionStarter]: For program point L1253-6(lines 1253 1261) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L444 ceAbstractionStarter]: At program point L1716(lines 1711 1719) the Hoare annotation is: false [2019-01-12 14:45:22,285 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L448 ceAbstractionStarter]: For program point L792(lines 791 955) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 536) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L444 ceAbstractionStarter]: At program point L1519(lines 1508 1522) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:45:22,285 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2019-01-12 14:45:22,285 INFO L444 ceAbstractionStarter]: At program point L1388(lines 1378 1390) the Hoare annotation is: (let ((.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ~__ste_email_to0~0)) (.cse3 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) (not (= ULTIMATE.start_incoming_~client 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse6 (= 0 ~__ste_email_to1~0)) (.cse7 (= ~queue_empty~0 1))) (or (and (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse4 (not (= ULTIMATE.start_mail_~msg 1)) (not (= ULTIMATE.start_isEncrypted_~handle 1)) .cse5) .cse6 (= 0 ULTIMATE.start_incoming_~client)) .cse7) (and (and (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 (= 2 ULTIMATE.start_incoming_~client) .cse2 .cse3 .cse4 .cse5) .cse0) .cse6 .cse7))) [2019-01-12 14:45:22,286 INFO L451 ceAbstractionStarter]: At program point L1388-1(lines 1378 1390) the Hoare annotation is: true [2019-01-12 14:45:22,286 INFO L448 ceAbstractionStarter]: For program point L2379(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,286 INFO L448 ceAbstractionStarter]: For program point L2379-3(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,286 INFO L444 ceAbstractionStarter]: At program point L2379-2(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ~rjh~0 1)) (not (= ULTIMATE.start_setClientId_~handle 2)) (= ~in_encrypted~0 0) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:45:22,286 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2019-01-12 14:45:22,286 INFO L444 ceAbstractionStarter]: At program point L2379-5(lines 1 2840) the Hoare annotation is: (and (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (= ULTIMATE.start_setClientPrivateKey_~value 456) (= ULTIMATE.start_setClientId_~handle 2) (= ~in_encrypted~0 0) (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_rjh_~rjh___0) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (= ~queue_empty~0 1) (= ULTIMATE.start_setClientPrivateKey_~handle 2) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:45:22,286 INFO L444 ceAbstractionStarter]: At program point L1256-2(lines 1249 1264) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ~__ste_email_to0~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 (and .cse4 (= 1 ULTIMATE.start_getEmailTo_~handle) .cse5) .cse6) .cse7 .cse8) (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (not (= ULTIMATE.start_outgoing_~msg 1))) .cse5 .cse6) .cse7 .cse8))) [2019-01-12 14:45:22,286 INFO L448 ceAbstractionStarter]: For program point L1256-3(lines 1256 1260) no Hoare annotation was computed. [2019-01-12 14:45:22,286 INFO L448 ceAbstractionStarter]: For program point L2379-6(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L448 ceAbstractionStarter]: For program point L2379-9(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L444 ceAbstractionStarter]: At program point L2379-8(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (not (= ULTIMATE.start_setClientPrivateKey_~handle 2)) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1)) (= ~__ste_client_privateKey1~0 456) (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setClientPrivateKey_~handle 1)) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0)) [2019-01-12 14:45:22,287 INFO L448 ceAbstractionStarter]: For program point L1256-6(lines 1256 1260) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L444 ceAbstractionStarter]: At program point L2379-11(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,287 INFO L444 ceAbstractionStarter]: At program point L1256-8(lines 1249 1264) the Hoare annotation is: false [2019-01-12 14:45:22,287 INFO L448 ceAbstractionStarter]: For program point L1256-9(lines 1256 1260) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L448 ceAbstractionStarter]: For program point L2379-12(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L448 ceAbstractionStarter]: For program point L2379-15(lines 2379 2383) no Hoare annotation was computed. [2019-01-12 14:45:22,287 INFO L444 ceAbstractionStarter]: At program point L2379-14(lines 697 706) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,287 INFO L444 ceAbstractionStarter]: At program point L2379-17(lines 687 696) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,288 INFO L444 ceAbstractionStarter]: At program point L2711-1(lines 2685 2728) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,289 INFO L448 ceAbstractionStarter]: For program point L2711(lines 2711 2723) no Hoare annotation was computed. [2019-01-12 14:45:22,289 INFO L444 ceAbstractionStarter]: At program point L2711-3(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,289 INFO L448 ceAbstractionStarter]: For program point L2711-2(lines 2711 2723) no Hoare annotation was computed. [2019-01-12 14:45:22,289 INFO L444 ceAbstractionStarter]: At program point L2711-5(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,289 INFO L448 ceAbstractionStarter]: For program point L2711-4(lines 2711 2723) no Hoare annotation was computed. [2019-01-12 14:45:22,289 INFO L444 ceAbstractionStarter]: At program point L2711-7(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,289 INFO L448 ceAbstractionStarter]: For program point L2711-6(lines 2711 2723) no Hoare annotation was computed. [2019-01-12 14:45:22,289 INFO L448 ceAbstractionStarter]: For program point L2447-1(lines 2447 2457) no Hoare annotation was computed. [2019-01-12 14:45:22,289 INFO L444 ceAbstractionStarter]: At program point L2711-9(lines 1 2840) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2447(lines 2447 2457) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2711-8(lines 2711 2723) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2447-3(lines 2447 2457) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2447-2(lines 2447 2457) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2447-4(lines 2447 2457) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L444 ceAbstractionStarter]: At program point L730(lines 1 2840) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ~rjh~0 1)) (= ~in_encrypted~0 0) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2712(lines 2712 2720) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2712-2(lines 2712 2720) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2712-4(lines 2712 2720) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2712-6(lines 2712 2720) no Hoare annotation was computed. [2019-01-12 14:45:22,290 INFO L448 ceAbstractionStarter]: For program point L2712-8(lines 2712 2720) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L444 ceAbstractionStarter]: At program point L929(lines 916 945) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2581(lines 2581 2627) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2582(lines 2582 2593) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L444 ceAbstractionStarter]: At program point L865(lines 852 950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 954) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2715(lines 2715 2719) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2715-3(lines 2715 2719) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2649-1(lines 2649 2680) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2649(lines 2649 2680) no Hoare annotation was computed. [2019-01-12 14:45:22,291 INFO L444 ceAbstractionStarter]: At program point L2517(lines 2470 2523) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,291 INFO L448 ceAbstractionStarter]: For program point L2715-6(lines 2715 2719) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L2715-9(lines 2715 2719) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L2715-12(lines 2715 2719) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1064(lines 1064 1072) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1064-2(lines 1064 1072) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1064-4(lines 1064 1072) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 747) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L2650(lines 2650 2661) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L2650-1(lines 2650 2661) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1197-1(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,292 INFO L448 ceAbstractionStarter]: For program point L1197-2(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L1197-3(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L1197-4(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L1197-5(lines 1197 1208) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L934(lines 934 941) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L444 ceAbstractionStarter]: At program point L934-1(lines 791 955) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L2784(lines 2784 2800) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L2784-1(lines 2784 2800) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L2586(lines 2586 2592) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L1067(lines 1067 1071) no Hoare annotation was computed. [2019-01-12 14:45:22,293 INFO L444 ceAbstractionStarter]: At program point L1067-2(lines 1060 1075) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,293 INFO L448 ceAbstractionStarter]: For program point L1067-3(lines 1067 1071) no Hoare annotation was computed. [2019-01-12 14:45:22,301 INFO L444 ceAbstractionStarter]: At program point L1067-5(lines 1060 1075) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse2 .cse3 (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 1)) .cse5 .cse6) .cse7 .cse8) (and (and .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) .cse0 (= 1 ULTIMATE.start_getEmailTo_~handle)) .cse5 .cse6) .cse7 .cse8))) [2019-01-12 14:45:22,301 INFO L448 ceAbstractionStarter]: For program point L1067-6(lines 1067 1071) no Hoare annotation was computed. [2019-01-12 14:45:22,301 INFO L448 ceAbstractionStarter]: For program point L803(lines 803 810) no Hoare annotation was computed. [2019-01-12 14:45:22,301 INFO L444 ceAbstractionStarter]: At program point L1067-8(lines 1060 1075) the Hoare annotation is: false [2019-01-12 14:45:22,301 INFO L448 ceAbstractionStarter]: For program point L870(lines 870 874) no Hoare annotation was computed. [2019-01-12 14:45:22,301 INFO L444 ceAbstractionStarter]: At program point L738(lines 733 741) the Hoare annotation is: (and (= ~__ste_Client_Keyring0_User0~0 ~__ste_Client_Keyring0_User1~0) (not (= ~rjh~0 1)) (= ~in_encrypted~0 0) (= 0 ~__ste_email_to1~0) (= 0 ~__ste_Client_Keyring0_User0~0) (= ~queue_empty~0 1) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:45:22,301 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1739) no Hoare annotation was computed. [2019-01-12 14:45:22,301 INFO L448 ceAbstractionStarter]: For program point L1729-1(lines 1729 1739) no Hoare annotation was computed. [2019-01-12 14:45:22,302 INFO L448 ceAbstractionStarter]: For program point L2654(lines 2654 2660) no Hoare annotation was computed. [2019-01-12 14:45:22,302 INFO L448 ceAbstractionStarter]: For program point L2654-1(lines 2654 2660) no Hoare annotation was computed. [2019-01-12 14:45:22,302 INFO L444 ceAbstractionStarter]: At program point L2456(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,302 INFO L444 ceAbstractionStarter]: At program point L2456-2(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,302 INFO L444 ceAbstractionStarter]: At program point L2456-1(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,302 INFO L444 ceAbstractionStarter]: At program point L2456-4(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,302 INFO L444 ceAbstractionStarter]: At program point L2456-3(lines 2436 2460) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,302 INFO L448 ceAbstractionStarter]: For program point L1201(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1201-1(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1201-2(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1201-3(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1201-4(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1201-5(lines 1201 1207) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L444 ceAbstractionStarter]: At program point L1598(lines 1670 1682) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L2788(lines 2788 2799) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L2788-1(lines 2788 2799) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L448 ceAbstractionStarter]: For program point L1401(lines 1401 1414) no Hoare annotation was computed. [2019-01-12 14:45:22,303 INFO L444 ceAbstractionStarter]: At program point L1401-1(lines 1391 1417) the Hoare annotation is: (let ((.cse7 (= 0 ~__ste_email_to1~0)) (.cse2 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse8 (= ~queue_empty~0 1))) (or (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) .cse2 (= 1 ULTIMATE.start_getEmailTo_~handle) (= 1 ULTIMATE.start_mail_~msg)) .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (and (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse7 (and .cse2 .cse0 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse1 .cse3 (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse4 (not (= ULTIMATE.start_mail_~msg 1)) (not (= ULTIMATE.start_setEmailFrom_~handle 1)) .cse5 .cse6) .cse8))) [2019-01-12 14:45:22,304 INFO L448 ceAbstractionStarter]: For program point L1401-2(lines 1401 1414) no Hoare annotation was computed. [2019-01-12 14:45:22,309 INFO L451 ceAbstractionStarter]: At program point L1401-3(lines 1391 1417) the Hoare annotation is: true [2019-01-12 14:45:22,309 INFO L448 ceAbstractionStarter]: For program point L1733(lines 1733 1738) no Hoare annotation was computed. [2019-01-12 14:45:22,309 INFO L448 ceAbstractionStarter]: For program point L1733-1(lines 1733 1738) no Hoare annotation was computed. [2019-01-12 14:45:22,309 INFO L444 ceAbstractionStarter]: At program point L1206(lines 1193 1211) the Hoare annotation is: false [2019-01-12 14:45:22,309 INFO L444 ceAbstractionStarter]: At program point L1206-1(lines 1193 1211) the Hoare annotation is: (let ((.cse6 (= 0 ~__ste_email_to1~0)) (.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse2 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_incoming_~client 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= ~queue_empty~0 1))) (or (and (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse4 (not (= ULTIMATE.start_mail_~msg 1)) (not (= ULTIMATE.start_isEncrypted_~handle 1)) .cse5) .cse6 (= 0 ULTIMATE.start_incoming_~client)) .cse7) (and .cse6 (and .cse0 (and (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse4 .cse5)) .cse7))) [2019-01-12 14:45:22,309 INFO L444 ceAbstractionStarter]: At program point L1206-2(lines 1193 1211) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,310 INFO L444 ceAbstractionStarter]: At program point L1206-3(lines 1193 1211) the Hoare annotation is: false [2019-01-12 14:45:22,310 INFO L451 ceAbstractionStarter]: At program point L1206-4(lines 1193 1211) the Hoare annotation is: true [2019-01-12 14:45:22,310 INFO L451 ceAbstractionStarter]: At program point L1206-5(lines 1193 1211) the Hoare annotation is: true [2019-01-12 14:45:22,310 INFO L444 ceAbstractionStarter]: At program point L876(lines 866 949) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2792(lines 2792 2798) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2792-1(lines 2792 2798) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2564) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2528-2(lines 2528 2564) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2528-1(lines 2528 2564) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2396(lines 2396 2412) no Hoare annotation was computed. [2019-01-12 14:45:22,310 INFO L448 ceAbstractionStarter]: For program point L2528-4(lines 2528 2564) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L1405(lines 1405 1411) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2528-3(lines 2528 2564) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2396-2(lines 2396 2412) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L1405-2(lines 1405 1411) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2396-1(lines 2396 2412) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2396-4(lines 2396 2412) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2396-3(lines 2396 2412) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2595(lines 2595 2626) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2529(lines 2529 2537) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2529-2(lines 2529 2537) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2529-4(lines 2529 2537) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2529-6(lines 2529 2537) no Hoare annotation was computed. [2019-01-12 14:45:22,311 INFO L448 ceAbstractionStarter]: For program point L2529-8(lines 2529 2537) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L444 ceAbstractionStarter]: At program point L812(lines 799 954) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,312 INFO L444 ceAbstractionStarter]: At program point L614(lines 595 616) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2596(lines 2596 2607) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L747(line 747) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L747-1(line 747) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2663-1(lines 2663 2679) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2663(lines 2663 2679) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2664(lines 2664 2675) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2664-1(lines 2664 2675) no Hoare annotation was computed. [2019-01-12 14:45:22,312 INFO L448 ceAbstractionStarter]: For program point L2532(lines 2532 2536) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2400(lines 2400 2411) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2532-3(lines 2532 2536) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2400-2(lines 2400 2411) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2532-6(lines 2532 2536) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2400-1(lines 2400 2411) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2400-4(lines 2400 2411) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2400-3(lines 2400 2411) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2532-9(lines 2532 2536) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L2532-12(lines 2532 2536) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 888) no Hoare annotation was computed. [2019-01-12 14:45:22,313 INFO L444 ceAbstractionStarter]: At program point L2797-1(lines 2780 2803) the Hoare annotation is: false [2019-01-12 14:45:22,314 INFO L444 ceAbstractionStarter]: At program point L2797(lines 2780 2803) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= 2 ~__ste_email_to0~0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse3 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 (and .cse2 (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse3) .cse4 .cse5 .cse6) .cse7 .cse8) (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse4 .cse5 (and (= 1 ULTIMATE.start_outgoing__wrappee__Keys_~msg) .cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) .cse3 .cse6) .cse7 .cse8))) [2019-01-12 14:45:22,314 INFO L444 ceAbstractionStarter]: At program point L1741(lines 1720 1744) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,314 INFO L451 ceAbstractionStarter]: At program point L1741-1(lines 1720 1744) the Hoare annotation is: true [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L2600(lines 2600 2606) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L1082(lines 1082 1093) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L1082-1(lines 1082 1093) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L1082-2(lines 1082 1093) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L1082-3(lines 1082 1093) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L2668(lines 2668 2674) no Hoare annotation was computed. [2019-01-12 14:45:22,314 INFO L448 ceAbstractionStarter]: For program point L2668-1(lines 2668 2674) no Hoare annotation was computed. [2019-01-12 14:45:22,315 INFO L448 ceAbstractionStarter]: For program point L2404(lines 2404 2410) no Hoare annotation was computed. [2019-01-12 14:45:22,315 INFO L448 ceAbstractionStarter]: For program point L2404-2(lines 2404 2410) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2404-1(lines 2404 2410) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2404-4(lines 2404 2410) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2404-3(lines 2404 2410) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1224) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L1216-2(lines 1216 1224) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L1216-4(lines 1216 1224) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L1216-6(lines 1216 1224) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2539-1(lines 2539 2563) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2563) no Hoare annotation was computed. [2019-01-12 14:45:22,321 INFO L448 ceAbstractionStarter]: For program point L2539-3(lines 2539 2563) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2539-2(lines 2539 2563) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2539-4(lines 2539 2563) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1092) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1086-1(lines 1086 1092) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1086-2(lines 1086 1092) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1086-3(lines 1086 1092) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2540(lines 2540 2548) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2474(lines 2474 2520) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2540-2(lines 2540 2548) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2540-4(lines 2540 2548) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2540-6(lines 2540 2548) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L2540-8(lines 2540 2548) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1223) no Hoare annotation was computed. [2019-01-12 14:45:22,322 INFO L448 ceAbstractionStarter]: For program point L1219-3(lines 1219 1223) no Hoare annotation was computed. [2019-01-12 14:45:22,326 INFO L444 ceAbstractionStarter]: At program point L1219-5(lines 1212 1227) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= 2 ULTIMATE.start_setEmailTo_~value) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,326 INFO L448 ceAbstractionStarter]: For program point L1219-6(lines 1219 1223) no Hoare annotation was computed. [2019-01-12 14:45:22,326 INFO L448 ceAbstractionStarter]: For program point L1219-9(lines 1219 1223) no Hoare annotation was computed. [2019-01-12 14:45:22,326 INFO L451 ceAbstractionStarter]: At program point L1219-11(lines 1212 1227) the Hoare annotation is: true [2019-01-12 14:45:22,326 INFO L444 ceAbstractionStarter]: At program point L823(lines 813 953) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,326 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2486) no Hoare annotation was computed. [2019-01-12 14:45:22,326 INFO L444 ceAbstractionStarter]: At program point L2409-1(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L2409(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= ULTIMATE.start_test_~op1~0 0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L2409-3(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L2409-2(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L2409-4(lines 2392 2415) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L956(lines 790 957) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L444 ceAbstractionStarter]: At program point L890(lines 877 948) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (= 2 ULTIMATE.start_setup_rjh_~rjh___0) (= 2 ~rjh~0) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (= 0 ~__ste_email_to1~0) (not (= ULTIMATE.start_setClientId_~handle 1)) (not (= ~__ste_email_to0~0 1)) (= ~queue_empty~0 1)) [2019-01-12 14:45:22,327 INFO L448 ceAbstractionStarter]: For program point L2609(lines 2609 2625) no Hoare annotation was computed. [2019-01-12 14:45:22,327 INFO L448 ceAbstractionStarter]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2019-01-12 14:45:22,328 INFO L448 ceAbstractionStarter]: For program point L2543-3(lines 2543 2547) no Hoare annotation was computed. [2019-01-12 14:45:22,328 INFO L448 ceAbstractionStarter]: For program point L2543-6(lines 2543 2547) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2543-9(lines 2543 2547) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2543-12(lines 2543 2547) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2808(lines 2808 2820) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2808-2(lines 2808 2820) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2808-4(lines 2808 2820) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L448 ceAbstractionStarter]: For program point L2610(lines 2610 2621) no Hoare annotation was computed. [2019-01-12 14:45:22,332 INFO L444 ceAbstractionStarter]: At program point L1091(lines 1078 1096) the Hoare annotation is: (let ((.cse0 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse1 (= 2 ~rjh~0)) (.cse2 (= 2 ~__ste_email_to0~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_getEmailTo_~handle)) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse4 (and (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (= ~in_encrypted~0 0) (not (= ULTIMATE.start_setEmailTo_~value 1)) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse7 (= 0 ~__ste_email_to1~0)) (.cse8 (= ~queue_empty~0 1))) (or (and (= 0 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 .cse1 .cse2 .cse3 (and (not (= ULTIMATE.start_outgoing_~msg 1)) .cse4) .cse5 .cse6) .cse7 .cse8) (and (and .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse1 .cse2 .cse3 .cse5 .cse6 (and (= 1 ULTIMATE.start_getEmailTo_~handle) .cse4)) .cse7 .cse8))) [2019-01-12 14:45:22,333 INFO L444 ceAbstractionStarter]: At program point L1091-1(lines 1078 1096) the Hoare annotation is: (let ((.cse1 (= 2 ULTIMATE.start_setup_rjh_~rjh___0)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (and (and (= ULTIMATE.start_setClientId_~handle ULTIMATE.start_setup_chuck_~chuck___0) (not (= ULTIMATE.start_setup_chuck_~chuck___0 2)) (not (= ULTIMATE.start_setup_rjh_~rjh___0 1)) (not (= ULTIMATE.start_setClientId_~handle 1))) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_setEmailTo_~handle 1) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) (= ~in_encrypted~0 0) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0))) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse0 (= 0 ~__ste_email_to1~0)) (.cse7 (= ~queue_empty~0 1))) (or (and (and (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse0 (and .cse1 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse2 .cse3 (not (= ULTIMATE.start_outgoing__wrappee__Keys_~msg 1)) .cse4 (not (= ULTIMATE.start_mail_~msg 1)) .cse5 .cse6)) .cse7) (and (and .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 .cse5 .cse6) .cse0 .cse7))) [2019-01-12 14:45:22,333 INFO L444 ceAbstractionStarter]: At program point L1091-2(lines 1078 1096) the Hoare annotation is: false [2019-01-12 14:45:22,333 INFO L451 ceAbstractionStarter]: At program point L1091-3(lines 1078 1096) the Hoare annotation is: true [2019-01-12 14:45:22,333 INFO L448 ceAbstractionStarter]: For program point L2479(lines 2479 2485) no Hoare annotation was computed. [2019-01-12 14:45:22,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:45:22 BoogieIcfgContainer [2019-01-12 14:45:22,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:45:22,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:45:22,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:45:22,456 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:45:22,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:44:29" (3/4) ... [2019-01-12 14:45:22,460 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:45:22,508 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 132 nodes and edges [2019-01-12 14:45:22,512 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2019-01-12 14:45:22,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 14:45:22,519 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 14:45:22,522 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:45:22,567 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && !(msg == 1) && ((((((!(to == 1) && !(rjh == 1)) && handle == 1) && ((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && in_encrypted == 0) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && msg == handle) && 2 == value) && 1 == handle && ((((((!(to == 1) && !(rjh == 1)) && handle == 1) && ((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && in_encrypted == 0) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,569 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,570 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && ((((2 == rjh___0 && 2 == rjh) && (((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && (((((((((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(handle == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && ((1 == msg && ((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && 1 == msg) && 1 == handle) && 1 == msg) && 2 == __ste_email_to0) && 2 == to) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && 0 == __ste_email_to1) && ((((((((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && 1 == msg) && 2 == rjh___0) && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && msg == handle) && 2 == value) && queue_empty == 1) [2019-01-12 14:45:22,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && 0 == __ste_email_to1) && (((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == value) && queue_empty == 1) || ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && ((((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(client == 1)) && 1 == msg) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && 2 == value) && 0 == __ste_email_to1) && 0 == client) && queue_empty == 1) || ((0 == __ste_email_to1 && 2 == rjh___0 && (((((2 == \result && 2 == rjh) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(client == 1)) && 1 == msg) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && queue_empty == 1) [2019-01-12 14:45:22,572 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && ((((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && !(client == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && 2 == value) && 0 == __ste_email_to1) && 0 == client) && queue_empty == 1) || (((((((((2 == \result && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && !(client == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && 2 == value) && 2 == rjh___0) && 0 == __ste_email_to1) && queue_empty == 1) [2019-01-12 14:45:22,572 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 1)) && 2 == value) && queue_empty == 1) && handle == 1) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && \result == 1) && 1 == msg [2019-01-12 14:45:22,762 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:45:22,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:45:22,763 INFO L168 Benchmark]: Toolchain (without parser) took 57620.02 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 948.7 MB in the beginning and 1.8 GB in the end (delta: -856.2 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,765 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:45:22,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1070.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.97 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,768 INFO L168 Benchmark]: Boogie Preprocessor took 125.60 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,768 INFO L168 Benchmark]: RCFGBuilder took 3330.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 923.7 MB in the end (delta: 179.6 MB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,769 INFO L168 Benchmark]: TraceAbstraction took 52644.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 938.5 MB). Free memory was 923.7 MB in the beginning and 1.9 GB in the end (delta: -930.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,769 INFO L168 Benchmark]: Witness Printer took 307.03 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:45:22,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1070.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.97 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.60 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3330.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 923.7 MB in the end (delta: 179.6 MB). Peak memory consumption was 179.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52644.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 938.5 MB). Free memory was 923.7 MB in the beginning and 1.9 GB in the end (delta: -930.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 307.03 ms. Allocated memory is still 2.1 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 747]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 747]: 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: 1097]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && 2 == __ste_email_to0) && in_encrypted == 0) && !(handle == 1)) && 2 == value) && queue_empty == 1) && handle == 1) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && 1 == msg - InvariantResult [Line: 2345]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && !(rjh == 1)) && in_encrypted == 0) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0) && queue_empty == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: (((0 == \result && ((((2 == rjh___0 && 2 == rjh) && (((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 1702]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2780]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: ((((0 == \result && ((((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(client == 1)) && 1 == msg) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && 2 == value) && 0 == __ste_email_to1) && 0 == client) && queue_empty == 1) || ((0 == __ste_email_to1 && 2 == rjh___0 && (((((2 == \result && 2 == rjh) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(client == 1)) && 1 == msg) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && queue_empty == 1) - InvariantResult [Line: 1670]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1230]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2345]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1230]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1391]: Loop Invariant Derived loop invariant: (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && ((1 == msg && ((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && 1 == msg) && 1 == handle) && 1 == msg) && 2 == __ste_email_to0) && 2 == to) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && 0 == __ste_email_to1) && ((((((((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && 1 == msg) && 2 == rjh___0) && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && msg == handle) && 2 == value) && queue_empty == 1) - InvariantResult [Line: 1212]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 813]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 799]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1720]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1391]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1711]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1212]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 1577]: Loop Invariant Derived loop invariant: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && !(handle == 2)) && in_encrypted == 0) && !(handle == 1)) && queue_empty == 1) && !(__ste_email_to0 == 1)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(chuck___0 == 2)) && !(handle == 1)) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0 - InvariantResult [Line: 1577]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && !(handle == 2)) && in_encrypted == 0) && !(handle == 1)) && queue_empty == 1) && !(__ste_email_to0 == 1)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(chuck___0 == 2)) && !(handle == 1)) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && handle == 2) && in_encrypted == 0) && handle == rjh___0) && 0 == __ste_Client_Keyring0_User0) && 0 == __ste_email_to1) && handle == rjh) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && !(msg == 1) && ((((((!(to == 1) && !(rjh == 1)) && handle == 1) && ((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && in_encrypted == 0) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && msg == handle) && 2 == value) && 1 == handle && ((((((!(to == 1) && !(rjh == 1)) && handle == 1) && ((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && in_encrypted == 0) && !(value == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: (((0 == \result && 0 == __ste_email_to1) && (((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(msg == 1)) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == value) && queue_empty == 1) || ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 1)) && 2 == value) && queue_empty == 1) && handle == 1) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && \result == 1) && 1 == msg - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == chuck___0 && value == 456) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(handle == 1)) && queue_empty == 1) && handle == 2) && !(__ste_email_to0 == 1)) && __ste_client_privateKey1 == 456) && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0 - InvariantResult [Line: 2631]: Loop Invariant Derived loop invariant: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 2685]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1249]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1078]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2416]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2470]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2631]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && !(rjh == 1)) && !(handle == 2)) && in_encrypted == 0) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0) && queue_empty == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((__ste_client_privateKey1 == 456 && __ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1) && value == 456) && handle == 2) && in_encrypted == 0) && handle == rjh___0) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0) && handle == rjh) && queue_empty == 1) && handle == 2) && !(__ste_email_to0 == 1) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && !(rjh == 1)) && !(handle == 2)) && in_encrypted == 0) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0) && queue_empty == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1249]: Loop Invariant Derived loop invariant: ((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && ((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((0 == \result && (((((2 == rjh___0 && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 791]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1508]: Loop Invariant Derived loop invariant: (((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && 2 == __ste_email_to0) && in_encrypted == 0) && !(handle == 1)) && 2 == value) && queue_empty == 1) && handle == 1) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && 1 == msg - InvariantResult [Line: 877]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1626]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1378]: Loop Invariant Derived loop invariant: ((((0 == \result && ((((((((2 == rjh___0 && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && !(client == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && !(msg == 1)) && 2 == to) && !(msg == 1)) && !(handle == 1)) && 2 == value) && 0 == __ste_email_to1) && 0 == client) && queue_empty == 1) || (((((((((2 == \result && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(rjh == 1)) && handle == 1) && !(\result == 1)) && !(client == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == to) && 2 == value) && 2 == rjh___0) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 1378]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2577]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && 1 == msg) && queue_empty == 1 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: ((((((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(chuck___0 == 2)) && 2 == to) && 0 == __ste_email_to1) && !(handle == 1)) && 1 == msg) && 2 == value) && queue_empty == 1 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: ((((((((handle == chuck___0 && op1 == 0) && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 838]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((0 == \result && (((((((((((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 2 == rjh___0) && !(msg == 1)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && 2 == to) && !(handle == 1)) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) || (((((((((2 == rjh___0 && 2 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && (1 == msg && ((((((((handle == chuck___0 && !(chuck___0 == 2)) && !(rjh___0 == 1)) && !(handle == 1)) && !(to == 1)) && !(rjh == 1)) && handle == 1) && in_encrypted == 0) && !(__ste_email_to0 == 1)) && 1 == msg) && 1 == handle) && msg == handle) && 2 == value) && 0 == __ste_email_to1) && queue_empty == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((__ste_Client_Keyring0_User0 == __ste_Client_Keyring0_User1 && !(rjh == 1)) && in_encrypted == 0) && 0 == __ste_email_to1) && 0 == __ste_Client_Keyring0_User0) && queue_empty == 1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2392]: Loop Invariant Derived loop invariant: (((((((handle == chuck___0 && 2 == rjh___0) && 2 == rjh) && in_encrypted == 0) && !(chuck___0 == 2)) && 0 == __ste_email_to1) && !(handle == 1)) && !(__ste_email_to0 == 1)) && queue_empty == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 383 locations, 2 error locations. SAFE Result, 52.4s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 32.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 15325 SDtfs, 25127 SDslu, 35472 SDs, 0 SdLazy, 1624 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2907occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 6400 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 95 PreInvPairs, 751 NumberOfFragments, 3713 HoareAnnotationTreeSize, 95 FomulaSimplifications, 137154341 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 95 FomulaSimplificationsInter, 96035686 FormulaSimplificationTreeSizeReductionInter, 26.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1369 ConstructedInterpolants, 0 QuantifiedInterpolants, 179615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...