./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec4_product28_true-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_spec4_product28_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c155eed8904feb91bc357673889a45f80c4d03bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:28:35,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:28:35,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:28:35,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:28:35,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:28:35,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:28:35,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:28:35,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:28:35,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:28:35,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:28:35,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:28:35,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:28:35,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:28:35,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:28:35,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:28:35,790 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:28:35,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:28:35,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:28:35,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:28:35,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:28:35,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:28:35,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:28:35,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:28:35,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:28:35,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:28:35,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:28:35,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:28:35,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:28:35,806 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:28:35,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:28:35,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:28:35,808 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:28:35,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:28:35,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:28:35,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:28:35,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:28:35,810 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:28:35,838 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:28:35,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:28:35,841 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:28:35,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:28:35,845 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:28:35,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:28:35,845 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:28:35,846 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:28:35,846 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:28:35,846 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:28:35,846 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:28:35,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:28:35,846 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:28:35,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:28:35,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:28:35,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:28:35,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:28:35,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:28:35,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:28:35,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:28:35,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:28:35,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:28:35,851 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:28:35,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:28:35,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:28:35,851 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:28:35,852 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:28:35,857 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 -> c155eed8904feb91bc357673889a45f80c4d03bf [2019-01-01 23:28:35,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:28:35,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:28:35,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:28:35,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:28:35,943 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:28:35,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec4_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:28:36,012 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc81eea35/bd693f16a1814c16aa01d450af9827f1/FLAGdb7e69eba [2019-01-01 23:28:36,694 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:28:36,694 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec4_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:28:36,719 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc81eea35/bd693f16a1814c16aa01d450af9827f1/FLAGdb7e69eba [2019-01-01 23:28:36,826 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc81eea35/bd693f16a1814c16aa01d450af9827f1 [2019-01-01 23:28:36,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:28:36,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:28:36,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:28:36,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:28:36,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:28:36,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:28:36" (1/1) ... [2019-01-01 23:28:36,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7619eddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:36, skipping insertion in model container [2019-01-01 23:28:36,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:28:36" (1/1) ... [2019-01-01 23:28:36,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:28:36,936 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:28:37,725 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:28:37,750 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:28:38,004 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:28:38,102 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:28:38,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38 WrapperNode [2019-01-01 23:28:38,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:28:38,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:28:38,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:28:38,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:28:38,113 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:28:38" (1/1) ... [2019-01-01 23:28:38,147 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:28:38" (1/1) ... [2019-01-01 23:28:38,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:28:38,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:28:38,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:28:38,240 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:28:38,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (1/1) ... [2019-01-01 23:28:38,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:28:38,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:28:38,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:28:38,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:28:38,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (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:28:38,477 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:28:38,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:28:38,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:28:38,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:28:38,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:28:42,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:28:42,423 INFO L280 CfgBuilder]: Removed 291 assue(true) statements. [2019-01-01 23:28:42,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:28:42 BoogieIcfgContainer [2019-01-01 23:28:42,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:28:42,424 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:28:42,425 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:28:42,428 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:28:42,429 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:28:42,429 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:28:36" (1/3) ... [2019-01-01 23:28:42,431 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ba958cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:28:42, skipping insertion in model container [2019-01-01 23:28:42,431 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:28:42,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:28:38" (2/3) ... [2019-01-01 23:28:42,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ba958cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:28:42, skipping insertion in model container [2019-01-01 23:28:42,432 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:28:42,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:28:42" (3/3) ... [2019-01-01 23:28:42,435 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec4_product28_true-unreach-call_true-termination.cil.c [2019-01-01 23:28:42,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:28:42,494 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:28:42,494 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:28:42,494 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:28:42,494 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:28:42,494 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:28:42,494 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:28:42,494 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:28:42,495 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:28:42,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states. [2019-01-01 23:28:42,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:28:42,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:28:42,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:28:42,594 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:28:42,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:28:42,594 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:28:42,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states. [2019-01-01 23:28:42,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:28:42,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:28:42,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:28:42,628 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:28:42,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:28:42,645 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(16);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(20);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string24.base, #t~string24.offset, 1);call write~init~int(115, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(10, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~__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~string40.base, #t~string40.offset := #Ultimate.allocOnStack(10);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(12);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(10);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(18);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(16);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(16);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(44);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(44);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(11);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(19);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string87.base, #t~string87.offset, 1);call write~init~int(100, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(10, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string90.base, #t~string90.offset, 1);call write~init~int(100, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(10, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(13);~head~0.base, ~head~0.offset := 0, 0;call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(30);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(9);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(21);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(30);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(9);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(21);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(30);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(9);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(25);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(30);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(25); 223#L-1true havoc main_#res;havoc main_#t~nondet81, main_#t~ret82, main_~retValue_acc~40, main_~tmp~17;main_~retValue_acc~40 := main_#t~nondet81;havoc main_#t~nondet81;havoc main_~tmp~17; 256#L75true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 389#L83true main_#t~ret82 := valid_product_#res;main_~tmp~17 := main_#t~ret82;havoc main_#t~ret82; 120#L2435true assume 0 != main_~tmp~17;havoc setup_#t~nondet76, setup_#t~nondet78, setup_#t~nondet80, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.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~4.base, setup_~__cil_tmp3~4.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; 114#L2141true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 311#L2147-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; 351#L1706true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 73#L1712-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string75.base, #t~string75.offset;havoc setup_#t~nondet76;~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; 115#L2141-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 288#L2147-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; 337#L1706-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 82#L1712-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string77.base, #t~string77.offset;havoc setup_#t~nondet78;~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; 106#L2141-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 296#L2147-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; 342#L1706-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 67#L1712-8true setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string79.base, #t~string79.offset;havoc setup_#t~nondet80; 328#L2422true havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, 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~8, test_~tmp___0~3, test_~tmp___1~2, test_~tmp___2~2, test_~tmp___3~1, test_~tmp___4~1, 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~8;havoc test_~tmp___0~3;havoc test_~tmp___1~2;havoc test_~tmp___2~2;havoc test_~tmp___3~1;havoc test_~tmp___4~1;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; 392#L1052-1true [2019-01-01 23:28:42,645 INFO L796 eck$LassoCheckResult]: Loop: 392#L1052-1true assume !false; 358#L910true assume test_~splverifierCounter~0 < 4; 449#L911true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 184#L917true assume !(0 == test_~op1~0); 110#L930true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet27;havoc test_#t~nondet27; 353#L935true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 392#L1052-1true [2019-01-01 23:28:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:28:42,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:28:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:28:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:28:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:43,032 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:28:43,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:28:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:28:43,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:28:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:28:43,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:28:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:28:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:28:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:28:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:28:43,227 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:28:43,424 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:28:43,455 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:28:43,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:28:43,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:28:43,460 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:28:43,460 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:28:43,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:28:43,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:28:43,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:28:43,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec4_product28_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:28:43,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:28:43,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:28:43,494 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:28:43,540 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:28:43,593 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:28:43,605 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:28:43,743 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:28:44,148 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:28:44,188 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:28:44,189 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:28:44,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:28:44,207 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:28:44,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:28:44,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:28:44,276 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:28:44,302 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:28:44,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:28:44,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:28:44,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:28:44,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:28:44,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:28:44,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:28:44,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:28:44,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec4_product28_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:28:44,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:28:44,303 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:28:44,305 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:28:44,337 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:28:44,344 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:28:44,356 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:28:44,534 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:28:44,683 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:28:44,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:28:44,854 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:28:44,856 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:28:44,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:28:44,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:28:44,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:28:44,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:28:44,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:28:44,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:28:44,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:28:44,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:28:44,871 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:28:44,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:28:44,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:28:44,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:28:44,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:28:44,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:28:44,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:28:44,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:28:44,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:28:44,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:28:44,883 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:28:44,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:28:44,886 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:28:44,886 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:28:44,886 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:28:44,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:28:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:45,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:28:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:45,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:28:45,473 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:28:45,493 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:28:45,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 475 states. Second operand 4 states. [2019-01-01 23:28:46,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 475 states.. Second operand 4 states. Result 2052 states and 3594 transitions. Complement of second has 7 states. [2019-01-01 23:28:46,016 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:28:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:28:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2026 transitions. [2019-01-01 23:28:46,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2026 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:28:46,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:46,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2026 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:28:46,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:46,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2026 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:28:46,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:46,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2052 states and 3594 transitions. [2019-01-01 23:28:46,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-01 23:28:46,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2052 states to 863 states and 1568 transitions. [2019-01-01 23:28:46,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2019-01-01 23:28:46,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-01-01 23:28:46,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 1568 transitions. [2019-01-01 23:28:46,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:28:46,091 INFO L705 BuchiCegarLoop]: Abstraction has 863 states and 1568 transitions. [2019-01-01 23:28:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 1568 transitions. [2019-01-01 23:28:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 448. [2019-01-01 23:28:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-01 23:28:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 811 transitions. [2019-01-01 23:28:46,177 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 811 transitions. [2019-01-01 23:28:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:28:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:28:46,184 INFO L87 Difference]: Start difference. First operand 448 states and 811 transitions. Second operand 3 states. [2019-01-01 23:28:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:28:46,386 INFO L93 Difference]: Finished difference Result 876 states and 1587 transitions. [2019-01-01 23:28:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:28:46,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1587 transitions. [2019-01-01 23:28:46,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2019-01-01 23:28:46,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 876 states and 1587 transitions. [2019-01-01 23:28:46,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2019-01-01 23:28:46,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2019-01-01 23:28:46,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 876 states and 1587 transitions. [2019-01-01 23:28:46,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:28:46,410 INFO L705 BuchiCegarLoop]: Abstraction has 876 states and 1587 transitions. [2019-01-01 23:28:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1587 transitions. [2019-01-01 23:28:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 447. [2019-01-01 23:28:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-01 23:28:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 807 transitions. [2019-01-01 23:28:46,441 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:28:46,441 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:28:46,441 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:28:46,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 807 transitions. [2019-01-01 23:28:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:28:46,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:28:46,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:28:46,451 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:28:46,452 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:28:46,453 INFO L794 eck$LassoCheckResult]: Stem: 4215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(10);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(16);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(20);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string24.base, #t~string24.offset, 1);call write~init~int(115, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(10, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~__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~string40.base, #t~string40.offset := #Ultimate.allocOnStack(10);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(12);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(10);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(18);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(16);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(13);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(16);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(44);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(44);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(11);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(19);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string87.base, #t~string87.offset, 1);call write~init~int(100, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(10, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string90.base, #t~string90.offset, 1);call write~init~int(100, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(10, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(13);~head~0.base, ~head~0.offset := 0, 0;call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(30);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(9);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(21);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(30);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(9);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(21);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(30);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(9);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(25);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(30);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(25); 3990#L-1 havoc main_#res;havoc main_#t~nondet81, main_#t~ret82, main_~retValue_acc~40, main_~tmp~17;main_~retValue_acc~40 := main_#t~nondet81;havoc main_#t~nondet81;havoc main_~tmp~17; 3991#L75 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 4056#L83 main_#t~ret82 := valid_product_#res;main_~tmp~17 := main_#t~ret82;havoc main_#t~ret82; 4276#L2435 assume 0 != main_~tmp~17;havoc setup_#t~nondet76, setup_#t~nondet78, setup_#t~nondet80, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.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~4.base, setup_~__cil_tmp3~4.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; 4260#L2141 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4181#L2147-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; 4197#L1706 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4182#L1712-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string75.base, #t~string75.offset;havoc setup_#t~nondet76;~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; 4183#L2141-2 assume !(1 == setClientId_~handle); 4262#L2144-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4133#L2147-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; 4134#L1706-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4185#L1712-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string77.base, #t~string77.offset;havoc setup_#t~nondet78;~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; 4196#L2141-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4156#L2147-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; 4159#L1706-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4147#L1712-8 setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string79.base, #t~string79.offset;havoc setup_#t~nondet80; 4148#L2422 havoc test_#t~nondet26, test_#t~nondet27, test_#t~nondet28, test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, 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~8, test_~tmp___0~3, test_~tmp___1~2, test_~tmp___2~2, test_~tmp___3~1, test_~tmp___4~1, 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~8;havoc test_~tmp___0~3;havoc test_~tmp___1~2;havoc test_~tmp___2~2;havoc test_~tmp___3~1;havoc test_~tmp___4~1;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; 4254#L1052-1 assume !false; 4289#L910 [2019-01-01 23:28:46,459 INFO L796 eck$LassoCheckResult]: Loop: 4289#L910 assume test_~splverifierCounter~0 < 4; 4290#L911 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4371#L917 assume !(0 == test_~op1~0); 4246#L930 assume !(0 == test_~op2~0); 4240#L941 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet28;havoc test_#t~nondet28; 4242#L946 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; 4235#L1706-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4152#L1712-11 test_~op3~0 := 1; 4025#L1052-1 assume !false; 4289#L910 [2019-01-01 23:28:46,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:28:46,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:28:46,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:28:46,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:46,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:28:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:46,774 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:28:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:28:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:28:46,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:28:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:28:46,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:28:46,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:28:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:46,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:28:46,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:28:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:28:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:28:47,109 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 23:28:47,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:28:47,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:28:47,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:28:47,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:28:47,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:28:47,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:28:47,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:28:47,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:28:47,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec4_product28_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:28:47,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:28:47,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:28:47,145 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:28:47,157 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:28:47,187 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:28:47,192 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:28:47,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:28:47,204 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:28:47,207 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:28:47,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:28:47,403 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:28:47,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:28:47,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:28:47,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:28:47,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_~tmp___7~0=-5, ULTIMATE.start_test_#t~nondet28=-5} Honda state: {ULTIMATE.start_test_~tmp___7~0=-5, ULTIMATE.start_test_#t~nondet28=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:47,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:28:47,447 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:28:47,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:28:47,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:28:47,533 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:28:47,537 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:28:47,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:28:47,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:28:47,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:28:47,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:28:47,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:28:47,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:28:47,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:28:47,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec4_product28_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:28:47,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:28:47,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:28:47,545 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:28:47,643 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:28:47,704 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:28:47,724 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:28:47,727 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:28:47,730 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:28:47,741 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:28:48,122 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:28:48,188 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:28:48,189 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:28:48,189 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:28:48,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:28:48,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:28:48,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:28:48,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:28:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:28:48,194 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:28:48,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:28:48,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:28:48,199 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:28:48,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:28:48,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:28:48,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:28:48,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:28:48,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:28:48,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:28:48,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:28:48,206 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:28:48,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:28:48,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:28:48,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:28:48,210 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:28:48,210 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:28:48,210 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:28:48,211 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:28:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:28:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:48,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:28:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:28:48,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:28:48,661 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:28:48,662 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:28:48,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362 Second operand 4 states. [2019-01-01 23:28:48,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362. Second operand 4 states. Result 867 states and 1573 transitions. Complement of second has 6 states. [2019-01-01 23:28:48,759 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:28:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:28:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2019-01-01 23:28:48,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:28:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:28:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:48,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:28:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:28:48,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 867 states and 1573 transitions. [2019-01-01 23:28:48,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:28:48,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 867 states to 0 states and 0 transitions. [2019-01-01 23:28:48,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:28:48,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:28:48,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:28:48,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:28:48,775 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:28:48,775 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:28:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:28:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:28:48,776 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:28:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:28:48,776 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:28:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:28:48,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:28:48,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:28:48,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:28:48,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:28:48,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:28:48,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:28:48,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:28:48,780 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:28:48,780 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:28:48,781 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:28:48,781 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:28:48,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:28:48,781 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:28:48,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:28:48,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:28:48 BoogieIcfgContainer [2019-01-01 23:28:48,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:28:48,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:28:48,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:28:48,791 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:28:48,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:28:42" (3/4) ... [2019-01-01 23:28:48,797 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:28:48,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:28:48,798 INFO L168 Benchmark]: Toolchain (without parser) took 11967.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 940.6 MB in the beginning and 936.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,800 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:28:48,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1270.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,803 INFO L168 Benchmark]: Boogie Preprocessor took 164.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,805 INFO L168 Benchmark]: RCFGBuilder took 4019.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.6 MB in the end (delta: 202.5 MB). Peak memory consumption was 202.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,806 INFO L168 Benchmark]: BuchiAutomizer took 6366.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 878.6 MB in the beginning and 936.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:28:48,808 INFO L168 Benchmark]: Witness Printer took 6.31 ms. Allocated memory is still 1.3 GB. Free memory is still 936.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:28:48,814 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1270.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4019.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.6 MB in the end (delta: 202.5 MB). Peak memory consumption was 202.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6366.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 878.6 MB in the beginning and 936.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.31 ms. Allocated memory is still 1.3 GB. Free memory is still 936.4 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 6.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. 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, 844 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 447 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2852 SDtfs, 2440 SDslu, 3491 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: 14ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...