./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec0_product31_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec0_product31_false-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 576ddfaf1e59f9a3ae715c82285b55fc06272834 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:26:07,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:26:07,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:26:07,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:26:07,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:26:07,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:26:07,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:26:07,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:26:07,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:26:07,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:26:07,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:26:07,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:26:07,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:26:07,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:26:07,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:26:07,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:26:07,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:26:07,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:26:07,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:26:07,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:26:07,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:26:07,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:26:07,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:26:07,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:26:07,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:26:07,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:26:07,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:26:07,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:26:07,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:26:07,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:26:07,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:26:07,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:26:07,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:26:07,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:26:07,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:26:07,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:26:07,064 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:26:07,087 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:26:07,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:26:07,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:26:07,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:26:07,091 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:26:07,091 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:26:07,091 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:26:07,091 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:26:07,091 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:26:07,092 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:26:07,092 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:26:07,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:26:07,092 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:26:07,092 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:26:07,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:26:07,093 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:26:07,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:26:07,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:26:07,094 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:26:07,094 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:26:07,094 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:26:07,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:26:07,095 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:26:07,095 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:26:07,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:26:07,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:26:07,095 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:26:07,098 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:26:07,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:26:07,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:26:07,099 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:26:07,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:26:07,100 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 -> 576ddfaf1e59f9a3ae715c82285b55fc06272834 [2019-01-01 23:26:07,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:26:07,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:26:07,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:26:07,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:26:07,185 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:26:07,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec0_product31_false-unreach-call_true-termination.cil.c [2019-01-01 23:26:07,248 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba04babe/e932bf4763524865948b207d41ffb73b/FLAG2d12c274a [2019-01-01 23:26:07,815 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:26:07,817 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec0_product31_false-unreach-call_true-termination.cil.c [2019-01-01 23:26:07,867 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba04babe/e932bf4763524865948b207d41ffb73b/FLAG2d12c274a [2019-01-01 23:26:08,039 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba04babe/e932bf4763524865948b207d41ffb73b [2019-01-01 23:26:08,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:26:08,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:26:08,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:26:08,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:26:08,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:26:08,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:26:08" (1/1) ... [2019-01-01 23:26:08,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518c2c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:08, skipping insertion in model container [2019-01-01 23:26:08,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:26:08" (1/1) ... [2019-01-01 23:26:08,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:26:08,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:26:08,808 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:26:08,839 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:26:09,111 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:26:09,224 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:26:09,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09 WrapperNode [2019-01-01 23:26:09,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:26:09,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:26:09,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:26:09,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:26:09,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:26:09,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:26:09,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:26:09,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:26:09,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (1/1) ... [2019-01-01 23:26:09,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:26:09,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:26:09,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:26:09,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:26:09,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (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-01 23:26:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:26:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:26:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:26:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:26:09,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:26:14,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:26:14,036 INFO L280 CfgBuilder]: Removed 379 assue(true) statements. [2019-01-01 23:26:14,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:26:14 BoogieIcfgContainer [2019-01-01 23:26:14,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:26:14,038 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:26:14,039 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:26:14,043 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:26:14,044 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:26:14,045 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:26:08" (1/3) ... [2019-01-01 23:26:14,046 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516f45bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:26:14, skipping insertion in model container [2019-01-01 23:26:14,046 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:26:14,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:26:09" (2/3) ... [2019-01-01 23:26:14,047 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@516f45bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:26:14, skipping insertion in model container [2019-01-01 23:26:14,047 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:26:14,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:26:14" (3/3) ... [2019-01-01 23:26:14,050 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec0_product31_false-unreach-call_true-termination.cil.c [2019-01-01 23:26:14,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:26:14,126 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:26:14,126 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:26:14,127 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:26:14,127 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:26:14,127 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:26:14,127 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:26:14,127 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:26:14,127 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:26:14,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states. [2019-01-01 23:26:14,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:26:14,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:14,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:14,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:14,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:26:14,306 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:26:14,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states. [2019-01-01 23:26:14,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:26:14,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:14,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:14,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:14,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:26:14,346 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__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~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~__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;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(44);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(44);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(11);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(19);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string64.base, #t~string64.offset, 1);call write~init~int(100, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(10, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(100, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(10, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(16);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(20);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(21);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(16);~__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;call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(12);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(10);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(18);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(16);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(21);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(13);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(25);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string135.base, #t~string135.offset, 1);call write~init~int(115, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(10, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1); 282#L-1true havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~14, main_~tmp~5;havoc main_~retValue_acc~14;havoc main_~tmp~5; 324#L1749true havoc valid_product_#res;havoc valid_product_~retValue_acc~21;havoc valid_product_~retValue_acc~21;valid_product_~retValue_acc~21 := 1;valid_product_#res := valid_product_~retValue_acc~21; 466#L1757true main_#t~ret59 := valid_product_#res;main_~tmp~5 := main_#t~ret59;havoc main_#t~ret59; 268#L1213true assume 0 != main_~tmp~5;havoc setup_#t~nondet54, setup_#t~nondet56, setup_#t~nondet58, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~2.base, setup_~__cil_tmp3~2.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~2.base, setup_~__cil_tmp3~2.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; 255#L2821true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 509#L2827-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; 544#L2386true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 235#L2392-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string53.base, #t~string53.offset;havoc setup_#t~nondet54;~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; 246#L2821-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 519#L2827-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; 557#L2386-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 222#L2392-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string55.base, #t~string55.offset;havoc setup_#t~nondet56;~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; 250#L2821-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 486#L2827-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; 536#L2386-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 227#L2392-8true setup_~__cil_tmp3~2.base, setup_~__cil_tmp3~2.offset := #t~string57.base, #t~string57.offset;havoc setup_#t~nondet58; 399#L1200true havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, 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~3, 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~3;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; 329#L1011-1true [2019-01-01 23:26:14,355 INFO L796 eck$LassoCheckResult]: Loop: 329#L1011-1true assume !false; 431#L866true assume test_~splverifierCounter~0 < 4; 530#L867true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 54#L873true assume !(0 == test_~op1~0); 133#L886true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet36;havoc test_#t~nondet36; 426#L891true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 329#L1011-1true [2019-01-01 23:26:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:26:14,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:14,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:14,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:14,859 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-01 23:26:14,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:14,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:26:14,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:26:14,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:14,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:15,035 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:26:15,073 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:15,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:15,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:15,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:15,077 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:26:15,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:15,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:15,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:15,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec0_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:26:15,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:15,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:15,103 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-01 23:26:15,117 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-01 23:26:15,132 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-01 23:26:15,142 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-01 23:26:15,354 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:26:15,497 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:15,498 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-01 23:26:15,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:15,513 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-01 23:26:15,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:15,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:15,560 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:26:15,579 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:15,579 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:15,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:15,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:15,579 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:26:15,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:15,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:15,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:15,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec0_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:26:15,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:15,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:15,582 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-01 23:26:15,632 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-01 23:26:15,658 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-01 23:26:15,666 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-01 23:26:15,800 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:26:16,065 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:26:16,200 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:16,206 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:26:16,208 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-01 23:26:16,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:16,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:16,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:16,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:16,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:16,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:16,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:16,223 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:26:16,238 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:26:16,240 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:26:16,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:26:16,242 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:26:16,247 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:26:16,248 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-01 23:26:16,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:26:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:16,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:16,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:16,675 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-01 23:26:16,695 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-01 23:26:16,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 561 states. Second operand 4 states. [2019-01-01 23:26:17,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 561 states.. Second operand 4 states. Result 2478 states and 4252 transitions. Complement of second has 7 states. [2019-01-01 23:26:17,311 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-01 23:26:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:26:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2418 transitions. [2019-01-01 23:26:17,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2418 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:26:17,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:17,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2418 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:26:17,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:17,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2418 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:26:17,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:17,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2478 states and 4252 transitions. [2019-01-01 23:26:17,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2019-01-01 23:26:17,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2478 states to 879 states and 1596 transitions. [2019-01-01 23:26:17,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-01 23:26:17,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-01-01 23:26:17,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2019-01-01 23:26:17,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:17,384 INFO L705 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2019-01-01 23:26:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2019-01-01 23:26:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2019-01-01 23:26:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-01 23:26:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2019-01-01 23:26:17,475 INFO L728 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2019-01-01 23:26:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:26:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:26:17,481 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2019-01-01 23:26:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:17,667 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2019-01-01 23:26:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:26:17,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2019-01-01 23:26:17,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2019-01-01 23:26:17,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2019-01-01 23:26:17,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-01 23:26:17,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-01 23:26:17,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2019-01-01 23:26:17,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:26:17,690 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2019-01-01 23:26:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2019-01-01 23:26:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2019-01-01 23:26:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-01 23:26:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2019-01-01 23:26:17,711 INFO L728 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-01 23:26:17,711 INFO L608 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-01 23:26:17,712 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:26:17,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2019-01-01 23:26:17,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-01 23:26:17,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:26:17,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:26:17,717 INFO L866 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-01 23:26:17,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:26:17,718 INFO L794 eck$LassoCheckResult]: Stem: 4805#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__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~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~__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;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(44);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(44);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(11);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(19);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string64.base, #t~string64.offset, 1);call write~init~int(100, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(10, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(100, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(10, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(10);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(16);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(20);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(21);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(16);~__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;call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(12);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(10);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(18);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(16);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(21);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(13);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(25);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string135.base, #t~string135.offset, 1);call write~init~int(115, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(10, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1); 4558#L-1 havoc main_#res;havoc main_#t~ret59, main_~retValue_acc~14, main_~tmp~5;havoc main_~retValue_acc~14;havoc main_~tmp~5; 4559#L1749 havoc valid_product_#res;havoc valid_product_~retValue_acc~21;havoc valid_product_~retValue_acc~21;valid_product_~retValue_acc~21 := 1;valid_product_#res := valid_product_~retValue_acc~21; 4644#L1757 main_#t~ret59 := valid_product_#res;main_~tmp~5 := main_#t~ret59;havoc main_#t~ret59; 4898#L1213 assume 0 != main_~tmp~5;havoc setup_#t~nondet54, setup_#t~nondet56, setup_#t~nondet58, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~2.base, setup_~__cil_tmp3~2.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~2.base, setup_~__cil_tmp3~2.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; 4940#L2821 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4815#L2827-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; 4935#L2386 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4867#L2392-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string53.base, #t~string53.offset;havoc setup_#t~nondet54;~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; 4937#L2821-2 assume !(1 == setClientId_~handle); 4823#L2824-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4824#L2827-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; 4936#L2386-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4803#L2392-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string55.base, #t~string55.offset;havoc setup_#t~nondet56;~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; 4934#L2821-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4777#L2827-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; 4909#L2386-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4826#L2392-8 setup_~__cil_tmp3~2.base, setup_~__cil_tmp3~2.offset := #t~string57.base, #t~string57.offset;havoc setup_#t~nondet58; 4834#L1200 havoc test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, 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~3, 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~3;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; 4835#L1011-1 assume !false; 4653#L866 [2019-01-01 23:26:17,718 INFO L796 eck$LassoCheckResult]: Loop: 4653#L866 assume test_~splverifierCounter~0 < 4; 4882#L867 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4665#L873 assume !(0 == test_~op1~0); 4667#L886 assume !(0 == test_~op2~0); 4846#L897 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet37;havoc test_#t~nondet37; 4848#L902 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; 4879#L2386-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4837#L2392-11 test_~op3~0 := 1; 4532#L1011-1 assume !false; 4653#L866 [2019-01-01 23:26:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:26:17,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:17,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:17,874 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-01 23:26:17,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:26:17,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:26:17,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:26:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:26:17,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:26:17,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:26:17,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:17,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:26:17,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:26:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:26:18,070 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 23:26:18,134 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:18,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:18,134 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:18,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:18,135 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:26:18,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:18,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:18,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:18,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec0_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:26:18,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:18,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:18,138 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-01 23:26:18,221 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-01 23:26:18,312 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-01 23:26:18,353 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-01 23:26:18,469 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:26:18,470 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-01 23:26:18,505 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-01 23:26:18,533 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-01 23:26:18,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:18,825 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-01 23:26:18,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:26:18,829 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-01 23:26:18,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:26:18,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:26:18,881 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:26:18,883 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:26:18,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:26:18,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:26:18,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:26:18,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:26:18,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:26:18,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:26:18,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:26:18,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec0_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:26:18,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:26:18,884 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:26:18,886 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-01 23:26:18,897 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-01 23:26:18,903 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-01 23:26:18,910 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-01 23:26:18,920 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-01 23:26:18,924 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-01 23:26:18,936 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-01 23:26:19,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:26:19,084 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:26:19,084 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-01 23:26:19,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:19,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:19,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:19,085 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:26:19,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:19,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:26:19,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:19,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:26:19,100 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-01 23:26:19,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:26:19,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:26:19,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:26:19,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:26:19,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:26:19,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:26:19,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:26:19,107 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:26:19,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:26:19,116 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:26:19,116 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:26:19,116 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:26:19,116 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:26:19,117 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-01 23:26:19,117 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:26:19,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:26:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:19,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:26:19,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:26:19,666 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-01 23:26:19,666 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-01 23:26:19,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2019-01-01 23:26:19,753 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-01 23:26:19,757 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-01 23:26:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:26:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2019-01-01 23:26:19,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:26:19,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:19,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:26:19,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:19,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:26:19,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:26:19,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2019-01-01 23:26:19,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:19,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2019-01-01 23:26:19,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:26:19,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:26:19,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:26:19,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:26:19,780 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:19,780 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:26:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:26:19,783 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:26:19,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:26:19,783 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:26:19,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:26:19,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:26:19,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:19,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:26:19,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:26:19,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:26:19,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:26:19,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:26:19,789 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:19,789 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:19,789 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:26:19,789 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:26:19,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:26:19,790 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:26:19,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:26:19,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:26:19 BoogieIcfgContainer [2019-01-01 23:26:19,801 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:26:19,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:26:19,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:26:19,802 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:26:19,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:26:14" (3/4) ... [2019-01-01 23:26:19,810 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:26:19,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:26:19,812 INFO L168 Benchmark]: Toolchain (without parser) took 11768.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 947.3 MB in the beginning and 899.6 MB in the end (delta: 47.8 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:19,816 INFO L168 Benchmark]: CDTParser took 0.19 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-01 23:26:19,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1178.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:19,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.16 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-01 23:26:19,822 INFO L168 Benchmark]: Boogie Preprocessor took 126.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:19,823 INFO L168 Benchmark]: RCFGBuilder took 4478.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.7 MB in the end (delta: 220.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:19,825 INFO L168 Benchmark]: BuchiAutomizer took 5762.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 857.7 MB in the beginning and 899.6 MB in the end (delta: -41.8 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:26:19,827 INFO L168 Benchmark]: Witness Printer took 9.92 ms. Allocated memory is still 1.3 GB. Free memory is still 899.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:26:19,834 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.19 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 1178.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 204.16 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 126.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4478.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.7 MB in the end (delta: 220.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5762.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 857.7 MB in the beginning and 899.6 MB in the end (delta: -41.8 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. * Witness Printer took 9.92 ms. Allocated memory is still 1.3 GB. Free memory is still 899.6 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.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s 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: 3139 SDtfs, 2720 SDslu, 3911 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 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...