./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec7_product25_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_spec7_product25_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 99165e14e6c37ec9e08b16c448d803f0086ba27d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:29:23,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:29:23,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:29:23,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:29:23,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:29:23,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:29:23,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:29:23,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:29:23,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:29:23,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:29:23,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:29:23,108 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:29:23,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:29:23,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:29:23,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:29:23,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:29:23,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:29:23,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:29:23,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:29:23,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:29:23,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:29:23,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:29:23,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:29:23,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:29:23,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:29:23,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:29:23,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:29:23,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:29:23,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:29:23,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:29:23,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:29:23,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:29:23,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:29:23,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:29:23,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:29:23,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:29:23,156 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:29:23,172 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:29:23,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:29:23,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:29:23,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:29:23,174 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:29:23,174 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:29:23,174 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:29:23,174 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:29:23,174 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:29:23,175 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:29:23,175 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:29:23,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:29:23,175 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:29:23,175 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:29:23,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:29:23,176 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:29:23,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:29:23,177 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:29:23,177 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:29:23,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:29:23,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:29:23,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:29:23,178 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:29:23,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:29:23,178 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:29:23,178 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:29:23,179 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:29:23,179 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 -> 99165e14e6c37ec9e08b16c448d803f0086ba27d [2019-01-01 23:29:23,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:29:23,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:29:23,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:29:23,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:29:23,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:29:23,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec7_product25_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:23,313 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652bc38b1/31d3fbe48b9c4473a98de08567f4edc6/FLAG023a6c5e4 [2019-01-01 23:29:23,882 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:29:23,884 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec7_product25_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:23,916 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652bc38b1/31d3fbe48b9c4473a98de08567f4edc6/FLAG023a6c5e4 [2019-01-01 23:29:24,094 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/652bc38b1/31d3fbe48b9c4473a98de08567f4edc6 [2019-01-01 23:29:24,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:29:24,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:29:24,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:29:24,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:29:24,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:29:24,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:29:24" (1/1) ... [2019-01-01 23:29:24,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec4065d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:24, skipping insertion in model container [2019-01-01 23:29:24,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:29:24" (1/1) ... [2019-01-01 23:29:24,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:29:24,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:29:24,964 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:29:25,000 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:29:25,229 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:29:25,329 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:29:25,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25 WrapperNode [2019-01-01 23:29:25,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:29:25,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:29:25,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:29:25,331 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:29:25,341 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:29:25" (1/1) ... [2019-01-01 23:29:25,378 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:29:25" (1/1) ... [2019-01-01 23:29:25,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:29:25,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:29:25,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:29:25,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:29:25,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (1/1) ... [2019-01-01 23:29:25,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:29:25,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:29:25,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:29:25,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:29:25,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (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:29:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:29:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:29:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:29:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:29:25,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:29:30,319 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:29:30,320 INFO L280 CfgBuilder]: Removed 609 assue(true) statements. [2019-01-01 23:29:30,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:30 BoogieIcfgContainer [2019-01-01 23:29:30,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:29:30,322 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:29:30,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:29:30,328 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:29:30,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:30,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:29:24" (1/3) ... [2019-01-01 23:29:30,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f1d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:30, skipping insertion in model container [2019-01-01 23:29:30,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:30,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:29:25" (2/3) ... [2019-01-01 23:29:30,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14f1d6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:29:30, skipping insertion in model container [2019-01-01 23:29:30,332 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:29:30,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:30" (3/3) ... [2019-01-01 23:29:30,333 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec7_product25_true-unreach-call_true-termination.cil.c [2019-01-01 23:29:30,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:29:30,393 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:29:30,393 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:29:30,393 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:29:30,393 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:29:30,393 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:29:30,394 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:29:30,394 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:29:30,394 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:29:30,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 864 states. [2019-01-01 23:29:30,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-01 23:29:30,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:30,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:30,514 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:29:30,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:30,515 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:29:30,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 864 states. [2019-01-01 23:29:30,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-01 23:29:30,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:30,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:30,534 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:29:30,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:29:30,541 INFO L794 eck$LassoCheckResult]: Stem: 338#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~string0.base, #t~string0.offset := #Ultimate.allocOnStack(10);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(30);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(16);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(20);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(115, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(44);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(44);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(11);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(19);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string64.base, #t~string64.offset, 1);call write~init~int(100, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(10, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(100, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(10, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(30);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(9);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(21);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(30);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(9);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(21);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(30);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(9);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(25);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(30);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(9);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(25);~__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;call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(12);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(18);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(13);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(16);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(25); 244#L-1true havoc main_#res;havoc main_#t~nondet58, main_#t~ret59, main_~retValue_acc~25, main_~tmp~13;main_~retValue_acc~25 := main_#t~nondet58;havoc main_#t~nondet58;havoc main_~tmp~13; 521#L433true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 156#L441true main_#t~ret59 := valid_product_#res;main_~tmp~13 := main_#t~ret59;havoc main_#t~ret59; 571#L1932true assume 0 != main_~tmp~13;havoc setup_#t~nondet53, setup_#t~nondet55, setup_#t~nondet57, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.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~1.base, setup_~__cil_tmp3~1.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; 612#L1774true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 454#L1780-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; 383#L1339true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 126#L1345-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string52.base, #t~string52.offset;havoc setup_#t~nondet53;~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; 614#L1774-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 461#L1780-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; 374#L1339-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 225#L1345-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string54.base, #t~string54.offset;havoc setup_#t~nondet55;~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; 616#L1774-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 446#L1780-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; 377#L1339-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 211#L1345-8true setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string56.base, #t~string56.offset;havoc setup_#t~nondet57; 176#L1919true havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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~2, 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~2;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; 701#L670-1true [2019-01-01 23:29:30,542 INFO L796 eck$LassoCheckResult]: Loop: 701#L670-1true assume !false; 476#L522true assume test_~splverifierCounter~0 < 4; 561#L523true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 168#L529true assume !(0 == test_~op1~0); 654#L542true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet32;havoc test_#t~nondet32; 443#L547true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 701#L670-1true [2019-01-01 23:29:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:29:30,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:30,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:30,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:30,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:30,990 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:29:30,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:29:30,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:29:30,996 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:29:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:29:30,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:30,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:30,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:31,253 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:29:31,274 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:31,275 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:31,275 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:31,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:31,280 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:29:31,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:31,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:31,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:31,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product25_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:29:31,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:31,282 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:31,307 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:29:31,402 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:29:31,490 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:29:31,524 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:29:31,651 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:31,652 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:29:31,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:29:31,658 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:29:31,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:29:31,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:29:31,709 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:29:31,732 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:31,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:31,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:31,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:31,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:29:31,733 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:31,733 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:31,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:31,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product25_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:29:31,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:31,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:31,736 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:29:31,754 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:29:31,765 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:29:31,778 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:29:32,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:32,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:29:32,158 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:29:32,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:32,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:32,160 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:29:32,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:32,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:29:32,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:32,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:29:32,171 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:29:32,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:32,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:32,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:32,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:29:32,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:32,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:29:32,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:32,178 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:29:32,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:29:32,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:29:32,187 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:29:32,187 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:29:32,187 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:29:32,188 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:29:32,190 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:29:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:32,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:32,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:32,552 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:29:32,571 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:29:32,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 864 states. Second operand 4 states. [2019-01-01 23:29:33,082 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 864 states.. Second operand 4 states. Result 3950 states and 6742 transitions. Complement of second has 7 states. [2019-01-01 23:29:33,085 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:29:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:29:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3884 transitions. [2019-01-01 23:29:33,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3884 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:29:33,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:33,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3884 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:29:33,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:33,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 3884 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:29:33,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:33,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3950 states and 6742 transitions. [2019-01-01 23:29:33,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 509 [2019-01-01 23:29:33,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3950 states to 1051 states and 1924 transitions. [2019-01-01 23:29:33,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2019-01-01 23:29:33,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 541 [2019-01-01 23:29:33,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1051 states and 1924 transitions. [2019-01-01 23:29:33,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:29:33,175 INFO L705 BuchiCegarLoop]: Abstraction has 1051 states and 1924 transitions. [2019-01-01 23:29:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states and 1924 transitions. [2019-01-01 23:29:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 542. [2019-01-01 23:29:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-01-01 23:29:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 989 transitions. [2019-01-01 23:29:33,249 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 989 transitions. [2019-01-01 23:29:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:29:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:29:33,256 INFO L87 Difference]: Start difference. First operand 542 states and 989 transitions. Second operand 3 states. [2019-01-01 23:29:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:29:33,456 INFO L93 Difference]: Finished difference Result 1064 states and 1943 transitions. [2019-01-01 23:29:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:29:33,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1064 states and 1943 transitions. [2019-01-01 23:29:33,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 510 [2019-01-01 23:29:33,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1064 states to 1064 states and 1943 transitions. [2019-01-01 23:29:33,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2019-01-01 23:29:33,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2019-01-01 23:29:33,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1064 states and 1943 transitions. [2019-01-01 23:29:33,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:29:33,482 INFO L705 BuchiCegarLoop]: Abstraction has 1064 states and 1943 transitions. [2019-01-01 23:29:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states and 1943 transitions. [2019-01-01 23:29:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 541. [2019-01-01 23:29:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-01-01 23:29:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 985 transitions. [2019-01-01 23:29:33,515 INFO L728 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-01 23:29:33,515 INFO L608 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-01 23:29:33,516 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:29:33,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 985 transitions. [2019-01-01 23:29:33,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-01 23:29:33,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:29:33,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:29:33,523 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:29:33,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:29:33,524 INFO L794 eck$LassoCheckResult]: Stem: 6883#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~string0.base, #t~string0.offset := #Ultimate.allocOnStack(10);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(34);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(30);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(16);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(20);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(115, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(44);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(44);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(11);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(19);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string64.base, #t~string64.offset, 1);call write~init~int(100, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(10, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(100, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(10, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 3 + #t~string67.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(30);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(9);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(21);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(30);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(9);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(21);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(30);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(9);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(25);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(30);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(9);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(25);~__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;call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(12);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(18);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(13);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(16);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(25); 6616#L-1 havoc main_#res;havoc main_#t~nondet58, main_#t~ret59, main_~retValue_acc~25, main_~tmp~13;main_~retValue_acc~25 := main_#t~nondet58;havoc main_#t~nondet58;havoc main_~tmp~13; 6617#L433 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 6754#L441 main_#t~ret59 := valid_product_#res;main_~tmp~13 := main_#t~ret59;havoc main_#t~ret59; 6886#L1932 assume 0 != main_~tmp~13;havoc setup_#t~nondet53, setup_#t~nondet55, setup_#t~nondet57, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.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~1.base, setup_~__cil_tmp3~1.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; 6887#L1774 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 6653#L1780-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; 6974#L1339 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6619#L1345-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string52.base, #t~string52.offset;havoc setup_#t~nondet53;~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; 6952#L1774-2 assume !(1 == setClientId_~handle); 6661#L1777-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 6662#L1780-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; 6967#L1339-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6636#L1345-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string54.base, #t~string54.offset;havoc setup_#t~nondet55;~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; 6971#L1774-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 6571#L1780-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; 6968#L1339-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6668#L1345-8 setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string56.base, #t~string56.offset;havoc setup_#t~nondet57; 7021#L1919 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, 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~2, 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~2;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; 7022#L670-1 assume !false; 6608#L522 [2019-01-01 23:29:33,524 INFO L796 eck$LassoCheckResult]: Loop: 6608#L522 assume test_~splverifierCounter~0 < 4; 6609#L523 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 6881#L529 assume !(0 == test_~op1~0); 6598#L542 assume !(0 == test_~op2~0); 7031#L553 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet33;havoc test_#t~nondet33; 7032#L558 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; 6972#L1339-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 6554#L1345-11 test_~op3~0 := 1; 6526#L670-1 assume !false; 6608#L522 [2019-01-01 23:29:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:29:33,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:33,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:33,762 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:29:33,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:29:33,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:29:33,764 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:29:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:33,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:29:33,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:29:33,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:29:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:29:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:29:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:29:34,108 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 23:29:34,194 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:34,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:34,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:34,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:34,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:29:34,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:34,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:34,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:34,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product25_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:29:34,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:34,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:34,197 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:29:34,205 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:29:34,210 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:29:34,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:34,227 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:29:34,239 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:29:34,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:34,399 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:34,400 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) [2019-01-01 23:29:34,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:29:34,409 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-01-01 23:29:34,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:29:34,457 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:34,482 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:29:34,483 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:29:34,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:29:34,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:29:34,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:29:34,484 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:29:34,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:29:34,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:29:34,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:29:34,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec7_product25_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:29:34,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:29:34,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:29:34,487 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:29:34,502 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:29:34,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:29:34,517 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:29:34,524 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:29:34,528 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:29:34,549 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:29:34,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:29:34,744 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:29:34,744 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:29:34,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:29:34,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:29:34,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:29:34,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:29:34,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:29:34,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:29:34,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:29:34,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:29:34,752 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:29:34,752 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:29:34,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:29:34,753 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:29:34,753 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:29:34,753 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:29:34,754 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:29:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:29:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:34,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:29:35,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:29:35,307 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:29:35,308 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:29:35,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446 Second operand 4 states. [2019-01-01 23:29:35,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446. Second operand 4 states. Result 1055 states and 1929 transitions. Complement of second has 6 states. [2019-01-01 23:29:35,493 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:29:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:29:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2019-01-01 23:29:35,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:29:35,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:35,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:29:35,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:35,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:29:35,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:29:35,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1929 transitions. [2019-01-01 23:29:35,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:35,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 0 states and 0 transitions. [2019-01-01 23:29:35,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:29:35,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:29:35,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:29:35,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:29:35,516 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:35,516 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:29:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:29:35,516 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:29:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:29:35,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:29:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:29:35,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:29:35,517 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:35,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:29:35,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:29:35,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:29:35,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:29:35,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:29:35,521 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:35,521 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:35,522 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:29:35,522 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:29:35,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:29:35,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:29:35,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:29:35,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:29:35 BoogieIcfgContainer [2019-01-01 23:29:35,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:29:35,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:29:35,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:29:35,533 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:29:35,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:29:30" (3/4) ... [2019-01-01 23:29:35,539 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:29:35,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:29:35,541 INFO L168 Benchmark]: Toolchain (without parser) took 11441.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -336.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:29:35,544 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:29:35,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1226.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:35,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:35,553 INFO L168 Benchmark]: Boogie Preprocessor took 186.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:35,555 INFO L168 Benchmark]: RCFGBuilder took 4606.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.0 MB). Peak memory consumption was 284.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:29:35,557 INFO L168 Benchmark]: BuchiAutomizer took 5209.99 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 93.3 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -117.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:29:35,559 INFO L168 Benchmark]: Witness Printer took 7.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:29:35,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1226.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 195.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 186.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4606.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.0 MB). Peak memory consumption was 284.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5209.99 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 93.3 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -117.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 7.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.2s. 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, 1032 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 541 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4409 SDtfs, 3907 SDslu, 5693 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...