./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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_spec3_product31_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c150255f8a1e762fd9c62ae945d63ba0fb5878d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:51:38,094 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:51:38,096 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:51:38,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:51:38,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:51:38,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:51:38,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:51:38,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:51:38,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:51:38,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:51:38,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:51:38,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:51:38,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:51:38,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:51:38,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:51:38,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:51:38,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:51:38,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:51:38,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:51:38,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:51:38,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:51:38,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:51:38,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:51:38,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:51:38,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:51:38,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:51:38,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:51:38,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:51:38,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:51:38,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:51:38,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:51:38,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:51:38,145 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:51:38,145 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:51:38,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:51:38,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:51:38,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:51:38,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:51:38,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:51:38,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:51:38,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:51:38,186 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:51:38,186 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:51:38,186 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:51:38,186 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:51:38,186 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:51:38,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:51:38,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:51:38,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:51:38,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:51:38,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:51:38,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:51:38,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:51:38,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:51:38,190 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:51:38,190 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:51:38,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:51:38,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:51:38,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:51:38,192 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:51:38,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:51:38,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:51:38,193 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:51:38,195 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:51:38,196 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 -> 4c150255f8a1e762fd9c62ae945d63ba0fb5878d [2018-11-28 23:51:38,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:51:38,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:51:38,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:51:38,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:51:38,266 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:51:38,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c [2018-11-28 23:51:38,337 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0a558c/9b3b58aad89b4518aa947fc999bf0947/FLAG0bd092af7 [2018-11-28 23:51:39,044 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:51:39,047 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec3_product31_false-unreach-call_true-termination.cil.c [2018-11-28 23:51:39,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0a558c/9b3b58aad89b4518aa947fc999bf0947/FLAG0bd092af7 [2018-11-28 23:51:39,207 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab0a558c/9b3b58aad89b4518aa947fc999bf0947 [2018-11-28 23:51:39,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:51:39,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:51:39,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:51:39,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:51:39,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:51:39,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:39" (1/1) ... [2018-11-28 23:51:39,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f31aaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:39, skipping insertion in model container [2018-11-28 23:51:39,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:39" (1/1) ... [2018-11-28 23:51:39,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:51:39,335 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:51:40,156 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:51:40,194 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:51:40,426 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:51:40,543 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:51:40,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40 WrapperNode [2018-11-28 23:51:40,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:51:40,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:51:40,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:51:40,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:51:40,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:51:40,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:51:40,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:51:40,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:51:40,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (1/1) ... [2018-11-28 23:51:40,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:51:40,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:51:40,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:51:40,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:51:40,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (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 [2018-11-28 23:51:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:51:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-28 23:51:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:51:40,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:51:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:51:45,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:51:45,068 INFO L280 CfgBuilder]: Removed 395 assue(true) statements. [2018-11-28 23:51:45,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:45 BoogieIcfgContainer [2018-11-28 23:51:45,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:51:45,071 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:51:45,071 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:51:45,075 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:51:45,076 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:51:45,076 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:51:39" (1/3) ... [2018-11-28 23:51:45,077 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6773afbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:51:45, skipping insertion in model container [2018-11-28 23:51:45,077 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:51:45,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40" (2/3) ... [2018-11-28 23:51:45,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6773afbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:51:45, skipping insertion in model container [2018-11-28 23:51:45,078 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:51:45,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:45" (3/3) ... [2018-11-28 23:51:45,080 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec3_product31_false-unreach-call_true-termination.cil.c [2018-11-28 23:51:45,149 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:51:45,149 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:51:45,149 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:51:45,150 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:51:45,150 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:51:45,150 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:51:45,150 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:51:45,150 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:51:45,150 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:51:45,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states. [2018-11-28 23:51:45,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2018-11-28 23:51:45,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:51:45,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:51:45,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:51:45,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:51:45,264 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:51:45,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states. [2018-11-28 23:51:45,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2018-11-28 23:51:45,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:51:45,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:51:45,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:51:45,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:51:45,290 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.alloc(44);call #t~string7.base, #t~string7.offset := #Ultimate.alloc(44);call #t~string9.base, #t~string9.offset := #Ultimate.alloc(9);call #t~string11.base, #t~string11.offset := #Ultimate.alloc(9);call #t~string13.base, #t~string13.offset := #Ultimate.alloc(11);call #t~string17.base, #t~string17.offset := #Ultimate.alloc(19);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string20.base, #t~string20.offset, 1);call write~init~int(100, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(10, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string23.base, #t~string23.offset, 1);call write~init~int(100, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(10, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.alloc(30);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(9);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(21);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(30);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(9);call #t~string53.base, #t~string53.offset := #Ultimate.alloc(21);call #t~string57.base, #t~string57.offset := #Ultimate.alloc(30);call #t~string58.base, #t~string58.offset := #Ultimate.alloc(9);call #t~string59.base, #t~string59.offset := #Ultimate.alloc(25);call #t~string60.base, #t~string60.offset := #Ultimate.alloc(30);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(9);call #t~string62.base, #t~string62.offset := #Ultimate.alloc(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.alloc(10);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(16);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(20);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(21);~sent_signed~0 := -1;call #t~string103.base, #t~string103.offset := #Ultimate.alloc(13);call #t~string106.base, #t~string106.offset := #Ultimate.alloc(16);call #t~string108.base, #t~string108.offset := #Ultimate.alloc(15);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(16);~__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~string117.base, #t~string117.offset := #Ultimate.alloc(10);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(12);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(10);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(18);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(16);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(21);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(13);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(16);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(25);call #t~string145.base, #t~string145.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string145.base, #t~string145.offset, 1);call write~init~int(115, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(10, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1); 296#L-1true havoc main_#res;havoc main_#t~ret15, main_~retValue_acc~17, main_~tmp~3;havoc main_~retValue_acc~17;havoc main_~tmp~3; 540#L1814true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 128#L1822true main_#t~ret15 := valid_product_#res;main_~tmp~3 := main_#t~ret15;havoc main_#t~ret15; 65#L1292true assume 0 != main_~tmp~3;havoc setup_#t~nondet10, setup_#t~nondet12, setup_#t~nondet14, 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; 231#L1102true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 450#L1108-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; 486#L667true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 218#L673-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~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; 234#L1102-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 457#L1108-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; 470#L667-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 193#L673-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12;~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; 236#L1102-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 426#L1108-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; 475#L667-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 167#L673-8true setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string13.base, #t~string13.offset;havoc setup_#t~nondet14; 183#L1279true havoc test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_#t~nondet76, 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~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 491#L2021-1true [2018-11-28 23:51:45,291 INFO L796 eck$LassoCheckResult]: Loop: 491#L2021-1true assume !false; 21#L1876true assume test_~splverifierCounter~0 < 4; 147#L1877true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 367#L1883true assume !(0 == test_~op1~0); 284#L1896true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet67;havoc test_#t~nondet67; 423#L1901true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 491#L2021-1true [2018-11-28 23:51:45,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2018-11-28 23:51:45,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:51:45,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:51:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:51:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:51:45,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:51:45,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:51:45,679 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:51:45,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2018-11-28 23:51:45,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:51:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:51:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:51:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:51:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:51:46,066 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:51:46,077 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:51:46,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:51:46,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:51:46,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:51:46,079 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:51:46,079 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:46,079 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:51:46,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:51:46,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:51:46,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:51:46,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:51:46,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,380 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:51:46,499 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:51:46,656 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 23:51:46,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:51:46,871 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 [2018-11-28 23:51:46,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:51:46,877 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 [2018-11-28 23:51:46,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:51:46,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:51:46,915 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:51:46,933 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:51:46,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:51:46,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:51:46,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:51:46,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:51:46,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:46,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:51:46,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:51:46,934 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:51:46,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:51:46,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:51:46,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:46,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:47,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:47,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:51:47,242 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:51:47,244 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 [2018-11-28 23:51:47,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:51:47,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:51:47,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:51:47,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:51:47,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:51:47,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:51:47,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:51:47,255 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:51:47,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:51:47,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:51:47,263 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:51:47,263 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:51:47,265 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:51:47,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2018-11-28 23:51:47,267 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:51:47,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:47,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:51:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:47,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:51:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:51:47,674 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 [2018-11-28 23:51:47,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 601 states. Second operand 4 states. [2018-11-28 23:51:48,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 601 states.. Second operand 4 states. Result 2678 states and 4608 transitions. Complement of second has 7 states. [2018-11-28 23:51:48,074 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 [2018-11-28 23:51:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:51:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2634 transitions. [2018-11-28 23:51:48,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-28 23:51:48,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:48,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 24 letters. Loop has 6 letters. [2018-11-28 23:51:48,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:48,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2634 transitions. Stem has 18 letters. Loop has 12 letters. [2018-11-28 23:51:48,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:48,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2678 states and 4608 transitions. [2018-11-28 23:51:48,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2018-11-28 23:51:48,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2678 states to 879 states and 1596 transitions. [2018-11-28 23:51:48,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2018-11-28 23:51:48,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2018-11-28 23:51:48,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2018-11-28 23:51:48,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:51:48,160 INFO L705 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2018-11-28 23:51:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2018-11-28 23:51:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2018-11-28 23:51:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 23:51:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2018-11-28 23:51:48,250 INFO L728 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2018-11-28 23:51:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:51:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:51:48,257 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2018-11-28 23:51:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:51:48,451 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2018-11-28 23:51:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:51:48,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2018-11-28 23:51:48,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2018-11-28 23:51:48,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2018-11-28 23:51:48,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2018-11-28 23:51:48,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2018-11-28 23:51:48,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2018-11-28 23:51:48,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:51:48,484 INFO L705 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2018-11-28 23:51:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2018-11-28 23:51:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2018-11-28 23:51:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-11-28 23:51:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2018-11-28 23:51:48,510 INFO L728 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2018-11-28 23:51:48,510 INFO L608 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2018-11-28 23:51:48,510 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:51:48,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2018-11-28 23:51:48,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2018-11-28 23:51:48,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:51:48,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:51:48,516 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] [2018-11-28 23:51:48,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:51:48,520 INFO L794 eck$LassoCheckResult]: Stem: 5024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.alloc(44);call #t~string7.base, #t~string7.offset := #Ultimate.alloc(44);call #t~string9.base, #t~string9.offset := #Ultimate.alloc(9);call #t~string11.base, #t~string11.offset := #Ultimate.alloc(9);call #t~string13.base, #t~string13.offset := #Ultimate.alloc(11);call #t~string17.base, #t~string17.offset := #Ultimate.alloc(19);call #t~string20.base, #t~string20.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string20.base, #t~string20.offset, 1);call write~init~int(100, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(10, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 3 + #t~string20.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string23.base, #t~string23.offset, 1);call write~init~int(100, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(10, #t~string23.base, 2 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 3 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string48.base, #t~string48.offset := #Ultimate.alloc(30);call #t~string49.base, #t~string49.offset := #Ultimate.alloc(9);call #t~string50.base, #t~string50.offset := #Ultimate.alloc(21);call #t~string51.base, #t~string51.offset := #Ultimate.alloc(30);call #t~string52.base, #t~string52.offset := #Ultimate.alloc(9);call #t~string53.base, #t~string53.offset := #Ultimate.alloc(21);call #t~string57.base, #t~string57.offset := #Ultimate.alloc(30);call #t~string58.base, #t~string58.offset := #Ultimate.alloc(9);call #t~string59.base, #t~string59.offset := #Ultimate.alloc(25);call #t~string60.base, #t~string60.offset := #Ultimate.alloc(30);call #t~string61.base, #t~string61.offset := #Ultimate.alloc(9);call #t~string62.base, #t~string62.offset := #Ultimate.alloc(25);~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.alloc(10);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(16);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(20);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(21);~sent_signed~0 := -1;call #t~string103.base, #t~string103.offset := #Ultimate.alloc(13);call #t~string106.base, #t~string106.offset := #Ultimate.alloc(16);call #t~string108.base, #t~string108.offset := #Ultimate.alloc(15);call #t~string110.base, #t~string110.offset := #Ultimate.alloc(16);~__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~string117.base, #t~string117.offset := #Ultimate.alloc(10);call #t~string120.base, #t~string120.offset := #Ultimate.alloc(12);call #t~string123.base, #t~string123.offset := #Ultimate.alloc(10);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(18);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(16);call #t~string132.base, #t~string132.offset := #Ultimate.alloc(21);call #t~string135.base, #t~string135.offset := #Ultimate.alloc(13);call #t~string138.base, #t~string138.offset := #Ultimate.alloc(16);call #t~string141.base, #t~string141.offset := #Ultimate.alloc(25);call #t~string145.base, #t~string145.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string145.base, #t~string145.offset, 1);call write~init~int(115, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(10, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1); 4768#L-1 havoc main_#res;havoc main_#t~ret15, main_~retValue_acc~17, main_~tmp~3;havoc main_~retValue_acc~17;havoc main_~tmp~3; 4769#L1814 havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 5021#L1822 main_#t~ret15 := valid_product_#res;main_~tmp~3 := main_#t~ret15;havoc main_#t~ret15; 4927#L1292 assume 0 != main_~tmp~3;havoc setup_#t~nondet10, setup_#t~nondet12, setup_#t~nondet14, 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; 4928#L1102 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4905#L1108-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; 5091#L667 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4892#L673-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string9.base, #t~string9.offset;havoc setup_#t~nondet10;~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; 5100#L1102-2 assume !(1 == setClientId_~handle); 4918#L1105-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4919#L1108-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; 5093#L667-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4908#L673-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string11.base, #t~string11.offset;havoc setup_#t~nondet12;~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; 5092#L1102-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4840#L1108-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; 5061#L667-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4921#L673-8 setup_~__cil_tmp3~1.base, setup_~__cil_tmp3~1.offset := #t~string13.base, #t~string13.offset;havoc setup_#t~nondet14; 5047#L1279 havoc test_#t~nondet66, test_#t~nondet67, test_#t~nondet68, test_#t~nondet69, test_#t~nondet70, test_#t~nondet71, test_#t~nondet72, test_#t~nondet73, test_#t~nondet74, test_#t~nondet75, test_#t~nondet76, 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~1, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 5084#L2021-1 assume !false; 4770#L1876 [2018-11-28 23:51:48,520 INFO L796 eck$LassoCheckResult]: Loop: 4770#L1876 assume test_~splverifierCounter~0 < 4; 4771#L1877 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 5011#L1883 assume !(0 == test_~op1~0); 4879#L1896 assume !(0 == test_~op2~0); 5053#L1907 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet68;havoc test_#t~nondet68; 5048#L1912 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; 5049#L667-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4842#L673-11 test_~op3~0 := 1; 4821#L2021-1 assume !false; 4770#L1876 [2018-11-28 23:51:48,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2018-11-28 23:51:48,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:51:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:51:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:48,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:51:48,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:51:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:51:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:51:48,720 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:51:48,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2018-11-28 23:51:48,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:51:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:51:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:48,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:51:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:51:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:51:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:51:48,887 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:51:48,942 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:51:48,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:51:48,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:51:48,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:51:48,943 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:51:48,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:48,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:51:48,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:51:48,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-11-28 23:51:48,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:51:48,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:51:48,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:48,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,204 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:51:49,205 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:49,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:51:49,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:51:49,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:51:49,220 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_#t~nondet68=7, ULTIMATE.start_test_~tmp___7~0=7} Honda state: {ULTIMATE.start_test_#t~nondet68=7, ULTIMATE.start_test_~tmp___7~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:49,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:51:49,244 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:51:49,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:51:49,297 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:49,338 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:51:49,341 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:51:49,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:51:49,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:51:49,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:51:49,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:51:49,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:51:49,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:51:49,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:51:49,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec3_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-11-28 23:51:49,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:51:49,342 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:51:49,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:51:49,862 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:51:50,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:51:50,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:51:50,008 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 [2018-11-28 23:51:50,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:51:50,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:51:50,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:51:50,011 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:51:50,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:51:50,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:51:50,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:51:50,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:51:50,021 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 [2018-11-28 23:51:50,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:51:50,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:51:50,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:51:50,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:51:50,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:51:50,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:51:50,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:51:50,029 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:51:50,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:51:50,033 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:51:50,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:51:50,033 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:51:50,034 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:51:50,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2018-11-28 23:51:50,034 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:51:50,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:51:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:50,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:51:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:51:50,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:51:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:51:50,527 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 [2018-11-28 23:51:50,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2018-11-28 23:51:50,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368. Second operand 4 states. Result 883 states and 1601 transitions. Complement of second has 6 states. [2018-11-28 23:51:50,625 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 [2018-11-28 23:51:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:51:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2018-11-28 23:51:50,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2018-11-28 23:51:50,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:50,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2018-11-28 23:51:50,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:50,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2018-11-28 23:51:50,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:51:50,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2018-11-28 23:51:50,644 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:51:50,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2018-11-28 23:51:50,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:51:50,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:51:50,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:51:50,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:51:50,645 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:51:50,645 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:51:50,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:51:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:51:50,648 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2018-11-28 23:51:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:51:50,648 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:51:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:51:50,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:51:50,648 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:51:50,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:51:50,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:51:50,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:51:50,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:51:50,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:51:50,651 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:51:50,651 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:51:50,651 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:51:50,651 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:51:50,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:51:50,651 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:51:50,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:51:50,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:51:50 BoogieIcfgContainer [2018-11-28 23:51:50,662 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:51:50,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:51:50,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:51:50,663 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:51:50,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:45" (3/4) ... [2018-11-28 23:51:50,671 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:51:50,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:51:50,672 INFO L168 Benchmark]: Toolchain (without parser) took 11459.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 946.0 MB in the beginning and 874.1 MB in the end (delta: 71.8 MB). Peak memory consumption was 311.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:51:50,676 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:51:50,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1326.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:51:50,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.55 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. [2018-11-28 23:51:50,681 INFO L168 Benchmark]: Boogie Preprocessor took 183.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:51:50,682 INFO L168 Benchmark]: RCFGBuilder took 4169.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.3 MB in the end (delta: 235.1 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:51:50,684 INFO L168 Benchmark]: BuchiAutomizer took 5591.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 844.3 MB in the beginning and 874.1 MB in the end (delta: -29.9 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:51:50,686 INFO L168 Benchmark]: Witness Printer took 9.32 ms. Allocated memory is still 1.3 GB. Free memory is still 874.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:51:50,697 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.36 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 1326.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 171.55 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 183.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4169.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.3 MB in the end (delta: 235.1 MB). Peak memory consumption was 235.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5591.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 844.3 MB in the beginning and 874.1 MB in the end (delta: -29.9 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.32 ms. Allocated memory is still 1.3 GB. Free memory is still 874.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 860 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 455 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3279 SDtfs, 2860 SDslu, 4121 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: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...