./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_spec11_product03_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 cdb705451c6fea738760a6b9963fc72ac4c0d764 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:35:54,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:35:54,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:35:54,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:35:54,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:35:54,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:35:54,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:35:54,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:35:54,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:35:54,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:35:54,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:35:54,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:35:54,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:35:54,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:35:54,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:35:54,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:35:54,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:35:54,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:35:54,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:35:54,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:35:54,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:35:54,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:35:54,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:35:54,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:35:54,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:35:54,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:35:54,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:35:54,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:35:54,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:35:54,859 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:35:54,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:35:54,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:35:54,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:35:54,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:35:54,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:35:54,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:35:54,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:35:54,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:35:54,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:35:54,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:35:54,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:35:54,896 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:35:54,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:35:54,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:35:54,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:35:54,896 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:35:54,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:35:54,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:35:54,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:35:54,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:35:54,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:35:54,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:35:54,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:35:54,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:35:54,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:35:54,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:35:54,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:35:54,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:35:54,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:35:54,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:35:54,902 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 -> cdb705451c6fea738760a6b9963fc72ac4c0d764 [2018-12-31 09:35:54,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:35:54,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:35:54,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:35:54,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:35:54,986 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:35:54,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c [2018-12-31 09:35:55,053 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c45982ad/1b7c54227ba94f8c97ce51700ab1830a/FLAG5c35f10f0 [2018-12-31 09:35:55,664 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:35:55,665 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c [2018-12-31 09:35:55,691 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c45982ad/1b7c54227ba94f8c97ce51700ab1830a/FLAG5c35f10f0 [2018-12-31 09:35:55,858 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c45982ad/1b7c54227ba94f8c97ce51700ab1830a [2018-12-31 09:35:55,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:35:55,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:35:55,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:35:55,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:35:55,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:35:55,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:35:55" (1/1) ... [2018-12-31 09:35:55,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:55, skipping insertion in model container [2018-12-31 09:35:55,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:35:55" (1/1) ... [2018-12-31 09:35:55,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:35:55,954 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:35:56,659 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:35:56,795 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:35:56,950 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:35:57,018 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:35:57,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57 WrapperNode [2018-12-31 09:35:57,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:35:57,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:35:57,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:35:57,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:35:57,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:35:57,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:35:57,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:35:57,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:35:57,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (1/1) ... [2018-12-31 09:35:57,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:35:57,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:35:57,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:35:57,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:35:57,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (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 [2018-12-31 09:35:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-12-31 09:35:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:35:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:35:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:35:57,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:35:59,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:35:59,130 INFO L280 CfgBuilder]: Removed 111 assue(true) statements. [2018-12-31 09:35:59,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:35:59 BoogieIcfgContainer [2018-12-31 09:35:59,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:35:59,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:35:59,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:35:59,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:35:59,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:35:55" (1/3) ... [2018-12-31 09:35:59,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbf05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:35:59, skipping insertion in model container [2018-12-31 09:35:59,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:35:57" (2/3) ... [2018-12-31 09:35:59,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbf05d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:35:59, skipping insertion in model container [2018-12-31 09:35:59,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:35:59" (3/3) ... [2018-12-31 09:35:59,140 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_product03_true-unreach-call_true-termination.cil.c [2018-12-31 09:35:59,150 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:35:59,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 09:35:59,177 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 09:35:59,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:35:59,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:35:59,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:35:59,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:35:59,210 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:35:59,210 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:35:59,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:35:59,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:35:59,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:35:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-12-31 09:35:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:35:59,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:35:59,238 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] [2018-12-31 09:35:59,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:35:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:35:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1526697543, now seen corresponding path program 1 times [2018-12-31 09:35:59,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:35:59,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:35:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:35:59,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:35:59,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:35:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:35:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:35:59,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:35:59,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:35:59,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:35:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:35:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:35:59,625 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 2 states. [2018-12-31 09:35:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:35:59,655 INFO L93 Difference]: Finished difference Result 189 states and 299 transitions. [2018-12-31 09:35:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:35:59,656 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-12-31 09:35:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:35:59,670 INFO L225 Difference]: With dead ends: 189 [2018-12-31 09:35:59,670 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 09:35:59,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:35:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 09:35:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-31 09:35:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-31 09:35:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2018-12-31 09:35:59,723 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 32 [2018-12-31 09:35:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:35:59,724 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2018-12-31 09:35:59,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:35:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2018-12-31 09:35:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:35:59,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:35:59,727 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] [2018-12-31 09:35:59,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:35:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:35:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash -380016211, now seen corresponding path program 1 times [2018-12-31 09:35:59,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:35:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:35:59,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:35:59,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:35:59,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:35:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:35:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:35:59,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:35:59,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:35:59,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:35:59,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:35:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:35:59,951 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand 3 states. [2018-12-31 09:36:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:00,154 INFO L93 Difference]: Finished difference Result 294 states and 468 transitions. [2018-12-31 09:36:00,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:36:00,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-31 09:36:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:00,159 INFO L225 Difference]: With dead ends: 294 [2018-12-31 09:36:00,159 INFO L226 Difference]: Without dead ends: 198 [2018-12-31 09:36:00,161 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 [2018-12-31 09:36:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-31 09:36:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 106. [2018-12-31 09:36:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 09:36:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 166 transitions. [2018-12-31 09:36:00,180 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 166 transitions. Word has length 33 [2018-12-31 09:36:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:00,181 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 166 transitions. [2018-12-31 09:36:00,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:36:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 166 transitions. [2018-12-31 09:36:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:36:00,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:00,184 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] [2018-12-31 09:36:00,184 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2080487648, now seen corresponding path program 1 times [2018-12-31 09:36:00,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:00,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:00,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:36:00,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:00,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:36:00,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:36:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:36:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:36:00,329 INFO L87 Difference]: Start difference. First operand 106 states and 166 transitions. Second operand 3 states. [2018-12-31 09:36:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:00,574 INFO L93 Difference]: Finished difference Result 198 states and 312 transitions. [2018-12-31 09:36:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:36:00,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-31 09:36:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:00,577 INFO L225 Difference]: With dead ends: 198 [2018-12-31 09:36:00,577 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 09:36:00,578 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 [2018-12-31 09:36:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 09:36:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-31 09:36:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 09:36:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 163 transitions. [2018-12-31 09:36:00,589 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 163 transitions. Word has length 34 [2018-12-31 09:36:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:00,590 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 163 transitions. [2018-12-31 09:36:00,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:36:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 163 transitions. [2018-12-31 09:36:00,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:36:00,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:00,592 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] [2018-12-31 09:36:00,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:00,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 77051259, now seen corresponding path program 1 times [2018-12-31 09:36:00,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:36:00,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:00,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:36:00,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:36:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:36:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:36:00,688 INFO L87 Difference]: Start difference. First operand 106 states and 163 transitions. Second operand 3 states. [2018-12-31 09:36:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:00,715 INFO L93 Difference]: Finished difference Result 169 states and 255 transitions. [2018-12-31 09:36:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:36:00,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 09:36:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:00,719 INFO L225 Difference]: With dead ends: 169 [2018-12-31 09:36:00,719 INFO L226 Difference]: Without dead ends: 109 [2018-12-31 09:36:00,724 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 [2018-12-31 09:36:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-31 09:36:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-31 09:36:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-31 09:36:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2018-12-31 09:36:00,747 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 36 [2018-12-31 09:36:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:00,747 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2018-12-31 09:36:00,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:36:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2018-12-31 09:36:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 09:36:00,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:00,754 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] [2018-12-31 09:36:00,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -382569238, now seen corresponding path program 1 times [2018-12-31 09:36:00,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:00,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:01,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:01,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 09:36:01,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:36:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:36:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:36:01,147 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand 10 states. [2018-12-31 09:36:02,327 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 09:36:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:02,938 INFO L93 Difference]: Finished difference Result 383 states and 530 transitions. [2018-12-31 09:36:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 09:36:02,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-12-31 09:36:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:02,942 INFO L225 Difference]: With dead ends: 383 [2018-12-31 09:36:02,942 INFO L226 Difference]: Without dead ends: 345 [2018-12-31 09:36:02,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:36:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-12-31 09:36:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 128. [2018-12-31 09:36:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 09:36:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2018-12-31 09:36:02,969 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 41 [2018-12-31 09:36:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:02,970 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2018-12-31 09:36:02,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:36:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2018-12-31 09:36:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 09:36:02,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:02,972 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] [2018-12-31 09:36:02,973 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:02,973 INFO L82 PathProgramCache]: Analyzing trace with hash -432538479, now seen corresponding path program 1 times [2018-12-31 09:36:02,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:02,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:36:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:36:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:36:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:36:03,259 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand 6 states. [2018-12-31 09:36:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:03,440 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2018-12-31 09:36:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:36:03,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-12-31 09:36:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:03,444 INFO L225 Difference]: With dead ends: 202 [2018-12-31 09:36:03,444 INFO L226 Difference]: Without dead ends: 138 [2018-12-31 09:36:03,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:36:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-31 09:36:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-31 09:36:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-31 09:36:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2018-12-31 09:36:03,463 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 42 [2018-12-31 09:36:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:03,464 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2018-12-31 09:36:03,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:36:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2018-12-31 09:36:03,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 09:36:03,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:03,467 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] [2018-12-31 09:36:03,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:03,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1755201452, now seen corresponding path program 1 times [2018-12-31 09:36:03,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:03,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:03,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:03,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:36:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:36:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:36:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:36:03,702 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand 5 states. [2018-12-31 09:36:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:03,981 INFO L93 Difference]: Finished difference Result 336 states and 494 transitions. [2018-12-31 09:36:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:36:03,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-31 09:36:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:03,984 INFO L225 Difference]: With dead ends: 336 [2018-12-31 09:36:03,984 INFO L226 Difference]: Without dead ends: 281 [2018-12-31 09:36:03,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:36:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-31 09:36:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 222. [2018-12-31 09:36:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-31 09:36:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 339 transitions. [2018-12-31 09:36:04,023 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 339 transitions. Word has length 42 [2018-12-31 09:36:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:04,023 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 339 transitions. [2018-12-31 09:36:04,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:36:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 339 transitions. [2018-12-31 09:36:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 09:36:04,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:04,025 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] [2018-12-31 09:36:04,026 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1213981371, now seen corresponding path program 1 times [2018-12-31 09:36:04,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:04,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:04,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:04,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:04,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 09:36:04,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:36:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:36:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:36:04,386 INFO L87 Difference]: Start difference. First operand 222 states and 339 transitions. Second operand 9 states. [2018-12-31 09:36:04,772 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 09:36:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:05,729 INFO L93 Difference]: Finished difference Result 640 states and 894 transitions. [2018-12-31 09:36:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 09:36:05,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-12-31 09:36:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:05,733 INFO L225 Difference]: With dead ends: 640 [2018-12-31 09:36:05,734 INFO L226 Difference]: Without dead ends: 533 [2018-12-31 09:36:05,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-12-31 09:36:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-31 09:36:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 293. [2018-12-31 09:36:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-31 09:36:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2018-12-31 09:36:05,771 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 43 [2018-12-31 09:36:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:05,772 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2018-12-31 09:36:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:36:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2018-12-31 09:36:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 09:36:05,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:05,774 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] [2018-12-31 09:36:05,774 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 405877855, now seen corresponding path program 1 times [2018-12-31 09:36:05,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:05,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:05,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:36:05,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:36:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:36:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:36:05,910 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand 4 states. [2018-12-31 09:36:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:06,023 INFO L93 Difference]: Finished difference Result 364 states and 527 transitions. [2018-12-31 09:36:06,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:36:06,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-31 09:36:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:06,025 INFO L225 Difference]: With dead ends: 364 [2018-12-31 09:36:06,025 INFO L226 Difference]: Without dead ends: 229 [2018-12-31 09:36:06,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:36:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-31 09:36:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2018-12-31 09:36:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-31 09:36:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2018-12-31 09:36:06,048 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 44 [2018-12-31 09:36:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:06,049 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2018-12-31 09:36:06,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:36:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2018-12-31 09:36:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 09:36:06,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:06,050 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] [2018-12-31 09:36:06,050 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash 495067749, now seen corresponding path program 1 times [2018-12-31 09:36:06,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:06,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:06,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:36:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:36:06,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:36:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:36:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:36:06,130 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 3 states. [2018-12-31 09:36:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:06,217 INFO L93 Difference]: Finished difference Result 551 states and 831 transitions. [2018-12-31 09:36:06,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:36:06,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 09:36:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:06,220 INFO L225 Difference]: With dead ends: 551 [2018-12-31 09:36:06,220 INFO L226 Difference]: Without dead ends: 373 [2018-12-31 09:36:06,221 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 [2018-12-31 09:36:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-12-31 09:36:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 253. [2018-12-31 09:36:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-31 09:36:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 397 transitions. [2018-12-31 09:36:06,251 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 397 transitions. Word has length 46 [2018-12-31 09:36:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:06,252 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 397 transitions. [2018-12-31 09:36:06,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:36:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 397 transitions. [2018-12-31 09:36:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 09:36:06,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:36:06,253 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] [2018-12-31 09:36:06,253 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:36:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:36:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2020018879, now seen corresponding path program 1 times [2018-12-31 09:36:06,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:36:06,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:36:06,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:06,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:36:06,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:36:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:36:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:36:06,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:36:06,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:36:06,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:36:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:36:06,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:36:06,395 INFO L87 Difference]: Start difference. First operand 253 states and 397 transitions. Second operand 4 states. [2018-12-31 09:36:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:36:06,654 INFO L93 Difference]: Finished difference Result 281 states and 435 transitions. [2018-12-31 09:36:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:36:06,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-31 09:36:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:36:06,655 INFO L225 Difference]: With dead ends: 281 [2018-12-31 09:36:06,655 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:36:06,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:36:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:36:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:36:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:36:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:36:06,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-12-31 09:36:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:36:06,658 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:36:06,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:36:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:36:06,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:36:06,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:36:06,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,929 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 96 [2018-12-31 09:36:06,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:06,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,402 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 67 [2018-12-31 09:36:07,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:36:07,883 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-31 09:36:08,089 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-31 09:36:08,294 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-31 09:36:08,456 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-12-31 09:36:09,183 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 16 [2018-12-31 09:36:09,423 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-12-31 09:36:09,577 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-12-31 09:36:09,803 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-12-31 09:36:09,998 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-12-31 09:36:10,220 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-31 09:36:10,470 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 14 [2018-12-31 09:36:10,659 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2018-12-31 09:36:10,804 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2018-12-31 09:36:10,985 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2018-12-31 09:36:11,143 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-12-31 09:36:11,283 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 238) no Hoare annotation was computed. [2018-12-31 09:36:11,283 INFO L448 ceAbstractionStarter]: For program point L1986(lines 1986 1994) no Hoare annotation was computed. [2018-12-31 09:36:11,283 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 511) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L500-1(lines 500 511) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L2449-1(lines 2449 2455) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L2449(lines 2449 2455) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2018-12-31 09:36:11,284 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2018-12-31 09:36:11,285 INFO L448 ceAbstractionStarter]: For program point L897(lines 897 903) no Hoare annotation was computed. [2018-12-31 09:36:11,285 INFO L444 ceAbstractionStarter]: At program point L897-1(lines 1 2544) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2018-12-31 09:36:11,285 INFO L448 ceAbstractionStarter]: For program point L897-2(lines 897 903) no Hoare annotation was computed. [2018-12-31 09:36:11,285 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2018-12-31 09:36:11,285 INFO L451 ceAbstractionStarter]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2018-12-31 09:36:11,286 INFO L444 ceAbstractionStarter]: At program point L2517-1(lines 2512 2520) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,286 INFO L444 ceAbstractionStarter]: At program point L2517(lines 2512 2520) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,286 INFO L448 ceAbstractionStarter]: For program point L1989(lines 1989 1993) no Hoare annotation was computed. [2018-12-31 09:36:11,286 INFO L444 ceAbstractionStarter]: At program point L1989-2(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,286 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 548) no Hoare annotation was computed. [2018-12-31 09:36:11,286 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2018-12-31 09:36:11,286 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 537 548) no Hoare annotation was computed. [2018-12-31 09:36:11,287 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 504 510) no Hoare annotation was computed. [2018-12-31 09:36:11,287 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 374) no Hoare annotation was computed. [2018-12-31 09:36:11,287 INFO L444 ceAbstractionStarter]: At program point L2454(lines 2437 2460) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,287 INFO L444 ceAbstractionStarter]: At program point L2454-1(lines 2437 2460) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5) (and .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse3 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse4 .cse2 .cse5))) [2018-12-31 09:36:11,287 INFO L444 ceAbstractionStarter]: At program point L968(lines 963 971) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2018-12-31 09:36:11,287 INFO L448 ceAbstractionStarter]: For program point L1959(lines 1959 1975) no Hoare annotation was computed. [2018-12-31 09:36:11,288 INFO L448 ceAbstractionStarter]: For program point L1959-1(lines 1959 1975) no Hoare annotation was computed. [2018-12-31 09:36:11,288 INFO L444 ceAbstractionStarter]: At program point L407(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,288 INFO L444 ceAbstractionStarter]: At program point L341(lines 331 366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,288 INFO L444 ceAbstractionStarter]: At program point L308(lines 298 369) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,288 INFO L444 ceAbstractionStarter]: At program point L275(lines 265 372) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,288 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 547) no Hoare annotation was computed. [2018-12-31 09:36:11,288 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2018-12-31 09:36:11,289 INFO L444 ceAbstractionStarter]: At program point L376(lines 231 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,289 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 248) no Hoare annotation was computed. [2018-12-31 09:36:11,289 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1010) no Hoare annotation was computed. [2018-12-31 09:36:11,289 INFO L448 ceAbstractionStarter]: For program point L1004-2(lines 1004 1010) no Hoare annotation was computed. [2018-12-31 09:36:11,289 INFO L444 ceAbstractionStarter]: At program point L509(lines 496 514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,289 INFO L451 ceAbstractionStarter]: At program point L509-1(lines 496 514) the Hoare annotation is: true [2018-12-31 09:36:11,289 INFO L451 ceAbstractionStarter]: At program point L179(lines 161 181) the Hoare annotation is: true [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 1974) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L1963-1(lines 1963 1974) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2018-12-31 09:36:11,290 INFO L444 ceAbstractionStarter]: At program point L876(lines 1 2544) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_incoming_~client) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,290 INFO L444 ceAbstractionStarter]: At program point L876-1(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,291 INFO L444 ceAbstractionStarter]: At program point L546(lines 533 551) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,291 INFO L444 ceAbstractionStarter]: At program point L546-1(lines 533 551) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,291 INFO L448 ceAbstractionStarter]: For program point L1967(lines 1967 1973) no Hoare annotation was computed. [2018-12-31 09:36:11,291 INFO L448 ceAbstractionStarter]: For program point L1967-1(lines 1967 1973) no Hoare annotation was computed. [2018-12-31 09:36:11,291 INFO L444 ceAbstractionStarter]: At program point L415(lines 410 418) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,291 INFO L444 ceAbstractionStarter]: At program point L250(lines 240 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:36:11,292 INFO L448 ceAbstractionStarter]: For program point L2465(lines 2465 2477) no Hoare annotation was computed. [2018-12-31 09:36:11,292 INFO L448 ceAbstractionStarter]: For program point L2465-2(lines 2465 2477) no Hoare annotation was computed. [2018-12-31 09:36:11,292 INFO L448 ceAbstractionStarter]: For program point L2465-4(lines 2465 2477) no Hoare annotation was computed. [2018-12-31 09:36:11,292 INFO L444 ceAbstractionStarter]: At program point L352(lines 342 365) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,292 INFO L444 ceAbstractionStarter]: At program point L319(lines 309 368) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,292 INFO L444 ceAbstractionStarter]: At program point L286(lines 276 371) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,292 INFO L444 ceAbstractionStarter]: At program point L1972(lines 1955 1978) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,293 INFO L444 ceAbstractionStarter]: At program point L1972-1(lines 1955 1978) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 0 ~__ste_client_autoResponse1~0) .cse0 (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= 0 |ULTIMATE.start_getClientAutoResponse_#res|) .cse1 .cse2) (and (= 2 ~rjh~0) (and .cse0 .cse1 .cse2) (= 2 ULTIMATE.start_createEmail_~to)))) [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 527) no Hoare annotation was computed. [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point L2468(lines 2468 2476) no Hoare annotation was computed. [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point L519-2(lines 519 527) no Hoare annotation was computed. [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point L2468-2(lines 2468 2476) no Hoare annotation was computed. [2018-12-31 09:36:11,293 INFO L448 ceAbstractionStarter]: For program point L519-4(lines 519 527) no Hoare annotation was computed. [2018-12-31 09:36:11,294 INFO L448 ceAbstractionStarter]: For program point L2468-4(lines 2468 2476) no Hoare annotation was computed. [2018-12-31 09:36:11,294 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 262) no Hoare annotation was computed. [2018-12-31 09:36:11,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:36:11,294 INFO L444 ceAbstractionStarter]: At program point L950(lines 945 953) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2018-12-31 09:36:11,294 INFO L444 ceAbstractionStarter]: At program point L158(lines 138 160) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,294 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 526) no Hoare annotation was computed. [2018-12-31 09:36:11,294 INFO L444 ceAbstractionStarter]: At program point L522-2(lines 515 530) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,294 INFO L448 ceAbstractionStarter]: For program point L522-3(lines 522 526) no Hoare annotation was computed. [2018-12-31 09:36:11,295 INFO L448 ceAbstractionStarter]: For program point L2471(lines 2471 2475) no Hoare annotation was computed. [2018-12-31 09:36:11,295 INFO L448 ceAbstractionStarter]: For program point L2471-3(lines 2471 2475) no Hoare annotation was computed. [2018-12-31 09:36:11,295 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2018-12-31 09:36:11,295 INFO L444 ceAbstractionStarter]: At program point L522-5(lines 515 530) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,295 INFO L444 ceAbstractionStarter]: At program point L2471-2(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,295 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2018-12-31 09:36:11,295 INFO L444 ceAbstractionStarter]: At program point L357-1(lines 232 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,295 INFO L448 ceAbstractionStarter]: For program point L522-6(lines 522 526) no Hoare annotation was computed. [2018-12-31 09:36:11,296 INFO L444 ceAbstractionStarter]: At program point L2471-5(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 2) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,296 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2018-12-31 09:36:11,296 INFO L444 ceAbstractionStarter]: At program point L522-8(lines 515 530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5) (and .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse3 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse4 .cse2 .cse5))) [2018-12-31 09:36:11,296 INFO L448 ceAbstractionStarter]: For program point L2471-6(lines 2471 2475) no Hoare annotation was computed. [2018-12-31 09:36:11,296 INFO L444 ceAbstractionStarter]: At program point L2471-8(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,296 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 564) no Hoare annotation was computed. [2018-12-31 09:36:11,296 INFO L448 ceAbstractionStarter]: For program point L556-2(lines 556 564) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point L556-4(lines 556 564) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point L1019(line 1019) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point L1019-1(line 1019) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2018-12-31 09:36:11,297 INFO L444 ceAbstractionStarter]: At program point L1020(lines 996 1013) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,297 INFO L451 ceAbstractionStarter]: At program point L1020-1(lines 996 1013) the Hoare annotation is: true [2018-12-31 09:36:11,297 INFO L448 ceAbstractionStarter]: For program point L2441-1(lines 2441 2457) no Hoare annotation was computed. [2018-12-31 09:36:11,298 INFO L448 ceAbstractionStarter]: For program point L2441(lines 2441 2457) no Hoare annotation was computed. [2018-12-31 09:36:11,298 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2018-12-31 09:36:11,298 INFO L444 ceAbstractionStarter]: At program point L559-2(lines 552 567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,298 INFO L444 ceAbstractionStarter]: At program point L2541(lines 2530 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:36:11,298 INFO L448 ceAbstractionStarter]: For program point L559-3(lines 559 563) no Hoare annotation was computed. [2018-12-31 09:36:11,298 INFO L444 ceAbstractionStarter]: At program point L559-5(lines 552 567) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ~rjh~0)) (.cse7 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse7 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse4 .cse5 .cse6 .cse8))) [2018-12-31 09:36:11,298 INFO L448 ceAbstractionStarter]: For program point L559-6(lines 559 563) no Hoare annotation was computed. [2018-12-31 09:36:11,298 INFO L451 ceAbstractionStarter]: At program point L559-8(lines 552 567) the Hoare annotation is: true [2018-12-31 09:36:11,299 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:36:11,299 INFO L444 ceAbstractionStarter]: At program point L330(lines 320 367) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,299 INFO L444 ceAbstractionStarter]: At program point L297(lines 287 370) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,299 INFO L444 ceAbstractionStarter]: At program point L264(lines 251 373) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:36:11,299 INFO L448 ceAbstractionStarter]: For program point L2445-1(lines 2445 2456) no Hoare annotation was computed. [2018-12-31 09:36:11,299 INFO L448 ceAbstractionStarter]: For program point L2445(lines 2445 2456) no Hoare annotation was computed. [2018-12-31 09:36:11,299 INFO L448 ceAbstractionStarter]: For program point L1983(lines 1983 1995) no Hoare annotation was computed. [2018-12-31 09:36:11,300 INFO L444 ceAbstractionStarter]: At program point L959(lines 954 962) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2018-12-31 09:36:11,300 INFO L448 ceAbstractionStarter]: For program point L233(lines 232 375) no Hoare annotation was computed. [2018-12-31 09:36:11,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:36:11 BoogieIcfgContainer [2018-12-31 09:36:11,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:36:11,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:36:11,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:36:11,363 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:36:11,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:35:59" (3/4) ... [2018-12-31 09:36:11,368 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:36:11,391 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2018-12-31 09:36:11,392 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:36:11,393 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 09:36:11,395 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:36:11,434 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 2 == value) && 1 == msg [2018-12-31 09:36:11,435 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:36:11,435 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:36:11,435 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:36:11,436 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:36:11,436 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg [2018-12-31 09:36:11,436 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,437 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,438 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,438 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg [2018-12-31 09:36:11,438 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,439 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg [2018-12-31 09:36:11,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg [2018-12-31 09:36:11,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && 1 == \result) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg) [2018-12-31 09:36:11,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:36:11,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg [2018-12-31 09:36:11,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2018-12-31 09:36:11,444 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) || ((2 == rjh && (handle == 3 && 1 == \result) && 1 == msg) && 2 == to) [2018-12-31 09:36:11,444 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2018-12-31 09:36:11,588 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:36:11,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:36:11,589 INFO L168 Benchmark]: Toolchain (without parser) took 15726.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -345.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:36:11,591 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-31 09:36:11,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:36:11,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:36:11,591 INFO L168 Benchmark]: Boogie Preprocessor took 65.45 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:36:11,592 INFO L168 Benchmark]: RCFGBuilder took 1920.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:36:11,592 INFO L168 Benchmark]: TraceAbstraction took 12230.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -295.8 MB). Peak memory consumption was 374.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:36:11,592 INFO L168 Benchmark]: Witness Printer took 225.47 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:36:11,598 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.17 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 1154.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.45 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1920.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.5 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12230.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -295.8 MB). Peak memory consumption was 374.5 MB. Max. memory is 11.5 GB. * Witness Printer took 225.47 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1019]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1019]: 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: 240]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 2530]: Loop Invariant Derived loop invariant: ((((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 2 == value) && 1 == msg - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg - InvariantResult [Line: 945]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && 1 == \result) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 954]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 2) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) || ((2 == rjh && (handle == 3 && 1 == \result) && 1 == msg) && 2 == to) - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 2 error locations. SAFE Result, 12.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 2010 SDtfs, 3203 SDslu, 3642 SDs, 0 SdLazy, 378 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=8, 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: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 776 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 172 NumberOfFragments, 1150 HoareAnnotationTreeSize, 46 FomulaSimplifications, 302804 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 46 FomulaSimplificationsInter, 15746 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 27983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...