./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec7_product19_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec7_product19_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bf58739501953fc4513dda9ff95b94959b3abc2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:10:31,143 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:10:31,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:10:31,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:10:31,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:10:31,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:10:31,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:10:31,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:10:31,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:10:31,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:10:31,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:10:31,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:10:31,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:10:31,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:10:31,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:10:31,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:10:31,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:10:31,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:10:31,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:10:31,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:10:31,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:10:31,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:10:31,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:10:31,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:10:31,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:10:31,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:10:31,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:10:31,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:10:31,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:10:31,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:10:31,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:10:31,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:10:31,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:10:31,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:10:31,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:10:31,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:10:31,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:10:31,227 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:10:31,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:10:31,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:10:31,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:10:31,229 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:10:31,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:10:31,229 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:10:31,229 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:10:31,229 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:10:31,230 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:10:31,230 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:10:31,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:10:31,230 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:10:31,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:10:31,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:10:31,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:10:31,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:10:31,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:10:31,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:10:31,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:10:31,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:10:31,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:10:31,233 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:10:31,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:10:31,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:10:31,234 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:10:31,235 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:10:31,235 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 3bf58739501953fc4513dda9ff95b94959b3abc2 [2019-01-14 04:10:31,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:10:31,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:10:31,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:10:31,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:10:31,303 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:10:31,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec7_product19_true-unreach-call_true-termination.cil.c [2019-01-14 04:10:31,365 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23515937c/fe971918027848b385ed5917d519a13c/FLAGfed5e1e0b [2019-01-14 04:10:31,961 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:10:31,961 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec7_product19_true-unreach-call_true-termination.cil.c [2019-01-14 04:10:31,982 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23515937c/fe971918027848b385ed5917d519a13c/FLAGfed5e1e0b [2019-01-14 04:10:32,160 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23515937c/fe971918027848b385ed5917d519a13c [2019-01-14 04:10:32,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:10:32,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:10:32,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:32,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:10:32,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:10:32,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:32" (1/1) ... [2019-01-14 04:10:32,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54188bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:32, skipping insertion in model container [2019-01-14 04:10:32,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:10:32" (1/1) ... [2019-01-14 04:10:32,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:10:32,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:10:32,881 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:32,908 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:10:33,175 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:10:33,268 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:10:33,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33 WrapperNode [2019-01-14 04:10:33,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:10:33,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:33,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:10:33,270 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:10:33,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:10:33,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:10:33,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:10:33,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:10:33,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (1/1) ... [2019-01-14 04:10:33,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:10:33,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:10:33,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:10:33,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:10:33,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:10:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:10:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:10:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:10:33,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:10:37,161 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:10:37,161 INFO L286 CfgBuilder]: Removed 295 assue(true) statements. [2019-01-14 04:10:37,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:37 BoogieIcfgContainer [2019-01-14 04:10:37,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:10:37,164 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:10:37,164 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:10:37,168 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:10:37,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:37,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:10:32" (1/3) ... [2019-01-14 04:10:37,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f563153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:37, skipping insertion in model container [2019-01-14 04:10:37,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:37,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:10:33" (2/3) ... [2019-01-14 04:10:37,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f563153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:10:37, skipping insertion in model container [2019-01-14 04:10:37,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:10:37,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:37" (3/3) ... [2019-01-14 04:10:37,174 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec7_product19_true-unreach-call_true-termination.cil.c [2019-01-14 04:10:37,244 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:10:37,245 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:10:37,245 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:10:37,246 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:10:37,246 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:10:37,246 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:10:37,246 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:10:37,246 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:10:37,246 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:10:37,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states. [2019-01-14 04:10:37,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:10:37,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:37,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:37,347 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:37,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:37,348 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:10:37,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states. [2019-01-14 04:10:37,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:10:37,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:37,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:37,364 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:37,365 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:10:37,372 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string1.base, #t~string1.offset, 1);call write~init~int(115, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(10, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 3 + #t~string1.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(10);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(12);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(10);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(18);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(16);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(10);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(16);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(20);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(21);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(44);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(44);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(9);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(9);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(11);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(19);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(100, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(10, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string113.base, #t~string113.offset, 1);call write~init~int(100, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(10, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0; 229#L-1true havoc main_#res;havoc main_#t~nondet104, main_#t~ret105, main_~retValue_acc~25, main_~tmp~16;main_~retValue_acc~25 := main_#t~nondet104;havoc main_#t~nondet104;havoc main_~tmp~16; 430#L525true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 17#L533true main_#t~ret105 := valid_product_#res;main_~tmp~16 := main_#t~ret105;havoc main_#t~ret105; 253#L1672true assume 0 != main_~tmp~16;havoc setup_#t~nondet99, setup_#t~nondet101, setup_#t~nondet103, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 216#L2865true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 410#L2871-2true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_bob_~bob___0, 123;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 422#L2430true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 197#L2436-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string98.base, #t~string98.offset;havoc setup_#t~nondet99;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 217#L2865-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 395#L2871-5true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_rjh_~rjh___0, 456;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 428#L2430-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 202#L2436-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string100.base, #t~string100.offset;havoc setup_#t~nondet101;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 212#L2865-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 404#L2871-8true setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_chuck_~chuck___0, 789;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 429#L2430-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 189#L2436-8true setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset := #t~string102.base, #t~string102.offset;havoc setup_#t~nondet103; 434#L1659true havoc test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 412#L1098-1true [2019-01-14 04:10:37,373 INFO L796 eck$LassoCheckResult]: Loop: 412#L1098-1true assume !false; 361#L953true assume test_~splverifierCounter~0 < 4; 335#L954true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 223#L960true assume !(0 == test_~op1~0); 31#L973true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet40;havoc test_#t~nondet40; 262#L978true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 412#L1098-1true [2019-01-14 04:10:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:37,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:10:37,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:37,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:10:37,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:10:37,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:37,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:38,084 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:10:38,202 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:10:38,212 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:38,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:38,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:38,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:38,214 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:38,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:38,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:38,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:38,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product19_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:38,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:38,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:38,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:38,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:38,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:38,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:38,531 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:38,647 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:38,801 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:10:39,029 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:39,136 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:39,137 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:39,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:39,150 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:39,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:39,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:39,196 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:39,214 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:39,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:39,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:39,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:39,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:39,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:39,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:39,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:39,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product19_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:10:39,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:39,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:39,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:39,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:39,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:39,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:39,541 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:10:39,802 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:10:39,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:39,948 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:39,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:10:39,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:39,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:39,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:39,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:39,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:39,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:39,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:39,960 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:39,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:39,966 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:39,968 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:39,968 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:39,969 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:39,969 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-14 04:10:39,971 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:40,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:40,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:40,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:10:40,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 433 states. Second operand 4 states. [2019-01-14 04:10:40,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 433 states.. Second operand 4 states. Result 1838 states and 3162 transitions. Complement of second has 7 states. [2019-01-14 04:10:40,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:10:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1764 transitions. [2019-01-14 04:10:40,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:10:40,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:40,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:10:40,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:40,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1764 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:10:40,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:40,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 3162 transitions. [2019-01-14 04:10:40,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2019-01-14 04:10:40,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 879 states and 1596 transitions. [2019-01-14 04:10:40,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-14 04:10:40,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-01-14 04:10:40,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2019-01-14 04:10:40,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:40,961 INFO L706 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2019-01-14 04:10:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2019-01-14 04:10:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2019-01-14 04:10:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-14 04:10:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2019-01-14 04:10:41,051 INFO L729 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2019-01-14 04:10:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:10:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:10:41,056 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2019-01-14 04:10:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:41,186 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2019-01-14 04:10:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:10:41,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2019-01-14 04:10:41,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2019-01-14 04:10:41,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2019-01-14 04:10:41,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-14 04:10:41,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-14 04:10:41,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2019-01-14 04:10:41,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:10:41,211 INFO L706 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2019-01-14 04:10:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2019-01-14 04:10:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2019-01-14 04:10:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-14 04:10:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2019-01-14 04:10:41,242 INFO L729 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:10:41,242 INFO L609 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:10:41,242 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:10:41,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2019-01-14 04:10:41,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:10:41,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:10:41,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:10:41,247 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:41,248 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:10:41,248 INFO L794 eck$LassoCheckResult]: Stem: 4024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string1.base, #t~string1.offset, 1);call write~init~int(115, #t~string1.base, 1 + #t~string1.offset, 1);call write~init~int(10, #t~string1.base, 2 + #t~string1.offset, 1);call write~init~int(0, #t~string1.base, 3 + #t~string1.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(30);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(9);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(21);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(30);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(9);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(21);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(25);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(25);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(10);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(12);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(10);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(18);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(16);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(10);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(16);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(20);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(21);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(44);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(44);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(9);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(9);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(11);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(19);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string110.base, #t~string110.offset, 1);call write~init~int(100, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(10, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string113.base, #t~string113.offset, 1);call write~init~int(100, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(10, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0; 3786#L-1 havoc main_#res;havoc main_#t~nondet104, main_#t~ret105, main_~retValue_acc~25, main_~tmp~16;main_~retValue_acc~25 := main_#t~nondet104;havoc main_#t~nondet104;havoc main_~tmp~16; 3787#L525 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 3780#L533 main_#t~ret105 := valid_product_#res;main_~tmp~16 := main_#t~ret105;havoc main_#t~ret105; 3781#L1672 assume 0 != main_~tmp~16;havoc setup_#t~nondet99, setup_#t~nondet101, setup_#t~nondet103, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 3882#L2865 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4026#L2871-2 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_bob_~bob___0, 123;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 4165#L2430 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4075#L2436-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string98.base, #t~string98.offset;havoc setup_#t~nondet99;~rjh~0 := 2;setup_rjh_#in~rjh___0 := ~rjh~0;havoc setup_rjh_~rjh___0;setup_rjh_~rjh___0 := setup_rjh_#in~rjh___0;setup_rjh__wrappee__Base_#in~rjh___0 := setup_rjh_~rjh___0;havoc setup_rjh__wrappee__Base_~rjh___0;setup_rjh__wrappee__Base_~rjh___0 := setup_rjh__wrappee__Base_#in~rjh___0;setClientId_#in~handle, setClientId_#in~value := setup_rjh__wrappee__Base_~rjh___0, setup_rjh__wrappee__Base_~rjh___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 4163#L2865-2 assume !(1 == setClientId_~handle); 4032#L2868-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4033#L2871-5 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_rjh_~rjh___0, 456;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 4158#L2430-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4080#L2436-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string100.base, #t~string100.offset;havoc setup_#t~nondet101;~chuck~0 := 3;setup_chuck_#in~chuck___0 := ~chuck~0;havoc setup_chuck_~chuck___0;setup_chuck_~chuck___0 := setup_chuck_#in~chuck___0;setup_chuck__wrappee__Base_#in~chuck___0 := setup_chuck_~chuck___0;havoc setup_chuck__wrappee__Base_~chuck___0;setup_chuck__wrappee__Base_~chuck___0 := setup_chuck__wrappee__Base_#in~chuck___0;setClientId_#in~handle, setClientId_#in~value := setup_chuck__wrappee__Base_~chuck___0, setup_chuck__wrappee__Base_~chuck___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 4164#L2865-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4063#L2871-8 setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := setup_chuck_~chuck___0, 789;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 4160#L2430-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4035#L2436-8 setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset := #t~string102.base, #t~string102.offset;havoc setup_#t~nondet103; 4159#L1659 havoc test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_#t~nondet46, test_#t~nondet47, test_#t~nondet48, test_#t~nondet49, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 4172#L1098-1 assume !false; 4126#L953 [2019-01-14 04:10:41,248 INFO L796 eck$LassoCheckResult]: Loop: 4126#L953 assume test_~splverifierCounter~0 < 4; 4108#L954 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4109#L960 assume !(0 == test_~op1~0); 3852#L973 assume !(0 == test_~op2~0); 3846#L984 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet41;havoc test_#t~nondet41; 3848#L989 assume 0 != test_~tmp___7~0;setClientPrivateKey_#in~handle, setClientPrivateKey_#in~value := ~rjh~0, 0;havoc setClientPrivateKey_~handle, setClientPrivateKey_~value;setClientPrivateKey_~handle := setClientPrivateKey_#in~handle;setClientPrivateKey_~value := setClientPrivateKey_#in~value; 3903#L2430-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4042#L2436-11 test_~op3~0 := 1; 3748#L1098-1 assume !false; 4126#L953 [2019-01-14 04:10:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:41,249 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:10:41,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:41,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:41,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:41,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:10:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:10:41,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:10:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:10:41,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:10:41,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:10:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:10:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:10:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:10:41,702 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:10:41,820 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:10:41,824 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:41,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:41,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:41,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:41,824 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:10:41,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:41,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:41,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:41,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product19_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:41,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:41,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:41,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:41,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:42,078 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:42,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:10:42,081 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:42,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:10:42,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:10:42,146 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:10:42,149 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:10:42,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:10:42,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:10:42,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:10:42,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:10:42,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:10:42,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:10:42,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:10:42,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product19_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:10:42,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:10:42,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:10:42,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:10:42,509 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:10:42,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:10:42,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:10:42,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:10:42,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:10:42,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:10:42,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:10:42,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:10:42,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:10:42,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:10:42,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:10:42,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:10:42,521 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:10:42,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:10:42,522 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:10:42,522 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:10:42,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-14 04:10:42,522 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:10:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:10:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:42,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:10:42,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:10:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:10:42,989 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:10:42,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2019-01-14 04:10:43,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368. Second operand 4 states. Result 883 states and 1601 transitions. Complement of second has 6 states. [2019-01-14 04:10:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:10:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:10:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2019-01-14 04:10:43,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:10:43,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:43,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:10:43,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:43,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:10:43,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:10:43,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2019-01-14 04:10:43,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:43,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2019-01-14 04:10:43,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:43,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:43,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:43,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:43,093 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:43,093 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:10:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:10:43,093 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:10:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:10:43,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:10:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:10:43,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:10:43,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:43,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:10:43,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:10:43,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:10:43,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:10:43,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:10:43,095 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:43,095 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:43,095 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:10:43,095 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:10:43,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:10:43,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:10:43,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:10:43,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:10:43 BoogieIcfgContainer [2019-01-14 04:10:43,103 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:10:43,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:10:43,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:10:43,103 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:10:43,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:10:37" (3/4) ... [2019-01-14 04:10:43,108 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:10:43,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:10:43,109 INFO L168 Benchmark]: Toolchain (without parser) took 10941.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 946.0 MB in the beginning and 976.1 MB in the end (delta: -30.1 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,110 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:10:43,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1097.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,112 INFO L168 Benchmark]: Boogie Preprocessor took 155.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,113 INFO L168 Benchmark]: RCFGBuilder took 3582.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 193.6 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,114 INFO L168 Benchmark]: BuchiAutomizer took 5938.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 906.5 MB in the beginning and 976.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:10:43,115 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:10:43,121 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.15 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 1097.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3582.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.5 MB in the end (delta: 193.6 MB). Peak memory consumption was 193.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5938.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 906.5 MB in the beginning and 976.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 976.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 860 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 455 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2703 SDtfs, 2284 SDslu, 3257 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...