./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec27_product34_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec27_product34_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 f9782708660048ad232400594e503373cec9f850 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:09:02,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:09:02,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:09:02,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:09:02,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:09:02,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:09:02,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:09:02,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:09:02,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:09:02,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:09:02,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:09:02,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:09:02,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:09:02,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:09:02,595 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:09:02,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:09:02,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:09:02,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:09:02,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:09:02,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:09:02,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:09:02,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:09:02,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:09:02,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:09:02,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:09:02,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:09:02,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:09:02,617 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:09:02,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:09:02,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:09:02,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:09:02,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:09:02,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:09:02,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:09:02,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:09:02,627 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:09:02,628 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:09:02,656 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:09:02,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:09:02,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:09:02,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:09:02,658 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:09:02,659 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:09:02,660 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:09:02,660 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:09:02,660 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:09:02,660 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:09:02,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:09:02,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:09:02,663 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:09:02,664 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:09:02,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:09:02,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:09:02,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:09:02,665 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:09:02,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:09:02,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:09:02,665 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:09:02,666 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:09:02,666 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 -> f9782708660048ad232400594e503373cec9f850 [2019-01-14 04:09:02,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:09:02,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:09:02,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:09:02,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:09:02,750 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:09:02,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec27_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:02,822 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e5b45fc/0042835bc50c4dc79542d93a82565215/FLAG6c9c3729b [2019-01-14 04:09:03,405 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:09:03,406 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec27_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:03,426 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e5b45fc/0042835bc50c4dc79542d93a82565215/FLAG6c9c3729b [2019-01-14 04:09:03,603 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e5b45fc/0042835bc50c4dc79542d93a82565215 [2019-01-14 04:09:03,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:09:03,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:09:03,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:03,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:09:03,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:09:03,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:03" (1/1) ... [2019-01-14 04:09:03,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5eacf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:03, skipping insertion in model container [2019-01-14 04:09:03,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:09:03" (1/1) ... [2019-01-14 04:09:03,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:09:03,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:09:04,421 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:04,607 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:09:04,772 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:09:04,914 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:09:04,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04 WrapperNode [2019-01-14 04:09:04,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:09:04,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:04,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:09:04,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:09:04,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:04,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:09:05,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:09:05,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:09:05,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:09:05,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... [2019-01-14 04:09:05,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:09:05,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:09:05,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:09:05,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:09:05,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:09:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:09:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:09:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:09:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:09:11,947 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:09:11,948 INFO L286 CfgBuilder]: Removed 861 assue(true) statements. [2019-01-14 04:09:11,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:11 BoogieIcfgContainer [2019-01-14 04:09:11,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:09:11,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:09:11,951 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:09:11,955 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:09:11,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:11,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:09:03" (1/3) ... [2019-01-14 04:09:11,957 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55d503c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:11, skipping insertion in model container [2019-01-14 04:09:11,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:11,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:09:04" (2/3) ... [2019-01-14 04:09:11,960 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55d503c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:09:11, skipping insertion in model container [2019-01-14 04:09:11,961 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:09:11,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:11" (3/3) ... [2019-01-14 04:09:11,963 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec27_product34_false-unreach-call_true-termination.cil.c [2019-01-14 04:09:12,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:09:12,033 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:09:12,033 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:09:12,033 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:09:12,034 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:09:12,035 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:09:12,035 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:09:12,035 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:09:12,035 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:09:12,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1314 states. [2019-01-14 04:09:12,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:09:12,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:12,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:12,251 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:12,252 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:12,252 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:09:12,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1314 states. [2019-01-14 04:09:12,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:09:12,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:12,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:12,297 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:12,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:09:12,309 INFO L794 eck$LassoCheckResult]: Stem: 442#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;call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(10);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(18);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(16);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(16);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string42.base, #t~string42.offset, 1);call write~init~int(115, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(10, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 3 + #t~string42.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(10);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(34);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(16);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(20);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(21);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(16);~head~0.base, ~head~0.offset := 0, 0;call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(30);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(9);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(21);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(30);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(9);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(21);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(30);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(25);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(30);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(9);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(44);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(44);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(9);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(11);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(19);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string137.base, #t~string137.offset, 1);call write~init~int(100, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(10, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string140.base, #t~string140.offset, 1);call write~init~int(100, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(10, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1); 375#L-1true havoc main_#res;havoc main_#t~ret132, main_~retValue_acc~43, main_~tmp~23;havoc main_~retValue_acc~43;havoc main_~tmp~23; 926#L1952true havoc valid_product_#res;havoc valid_product_~retValue_acc~34;havoc valid_product_~retValue_acc~34;valid_product_~retValue_acc~34 := 1;valid_product_#res := valid_product_~retValue_acc~34; 419#L1960true main_#t~ret132 := valid_product_#res;main_~tmp~23 := main_#t~ret132;havoc main_#t~ret132; 841#L2919true assume 0 != main_~tmp~23;havoc setup_#t~nondet127, setup_#t~nondet129, setup_#t~nondet131, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 250#L1102true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 1154#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; 1204#L667true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 839#L673-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string126.base, #t~string126.offset;havoc setup_#t~nondet127;~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; 255#L1102-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 1161#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; 1191#L667-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 819#L673-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string128.base, #t~string128.offset;havoc setup_#t~nondet129;~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; 257#L1102-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 1143#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; 1195#L667-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 805#L673-8true setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string130.base, #t~string130.offset;havoc setup_#t~nondet131; 469#L2906true havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~1, 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~7;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~1;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; 198#L1477-1true [2019-01-14 04:09:12,320 INFO L796 eck$LassoCheckResult]: Loop: 198#L1477-1true assume !false; 1277#L1329true assume test_~splverifierCounter~0 < 4; 1060#L1330true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 722#L1336true assume !(0 == test_~op1~0); 107#L1349true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet32;havoc test_#t~nondet32; 1104#L1354true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 198#L1477-1true [2019-01-14 04:09:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:09:12,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:12,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:12,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:09:12,810 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:09:12,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:12,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:12,997 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:09:13,118 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:09:13,129 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:13,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:13,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:13,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:13,131 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:13,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:13,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:13,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:13,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec27_product34_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:13,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:13,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:13,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:13,372 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:13,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:13,381 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) [2019-01-14 04:09:13,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:13,434 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:13,450 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:13,478 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:13,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:13,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:13,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:13,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:13,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:13,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:13,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:13,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec27_product34_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:09:13,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:13,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:13,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:13,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:13,649 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:13,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:13,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:13,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:13,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:13,654 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:09:13,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:13,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:09:13,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:13,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:09:13,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:13,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:13,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:13,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:13,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:13,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:13,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:13,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:13,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:13,679 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:13,680 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:13,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:13,683 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:13,683 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:13,683 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-14 04:09:13,685 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:14,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:14,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:09:14,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1314 states. Second operand 4 states. [2019-01-14 04:09:14,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1314 states.. Second operand 4 states. Result 6200 states and 10672 transitions. Complement of second has 7 states. [2019-01-14 04:09:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6242 transitions. [2019-01-14 04:09:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6242 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:09:14,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:14,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6242 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:09:14,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:14,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6242 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:09:14,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:14,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6200 states and 10672 transitions. [2019-01-14 04:09:14,925 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 509 [2019-01-14 04:09:14,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6200 states to 1051 states and 1924 transitions. [2019-01-14 04:09:14,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2019-01-14 04:09:14,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 541 [2019-01-14 04:09:14,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1051 states and 1924 transitions. [2019-01-14 04:09:14,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:14,963 INFO L706 BuchiCegarLoop]: Abstraction has 1051 states and 1924 transitions. [2019-01-14 04:09:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states and 1924 transitions. [2019-01-14 04:09:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 542. [2019-01-14 04:09:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-01-14 04:09:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 989 transitions. [2019-01-14 04:09:15,055 INFO L729 BuchiCegarLoop]: Abstraction has 542 states and 989 transitions. [2019-01-14 04:09:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:09:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:09:15,060 INFO L87 Difference]: Start difference. First operand 542 states and 989 transitions. Second operand 3 states. [2019-01-14 04:09:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:15,260 INFO L93 Difference]: Finished difference Result 1064 states and 1943 transitions. [2019-01-14 04:09:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:09:15,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1064 states and 1943 transitions. [2019-01-14 04:09:15,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 510 [2019-01-14 04:09:15,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1064 states to 1064 states and 1943 transitions. [2019-01-14 04:09:15,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2019-01-14 04:09:15,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2019-01-14 04:09:15,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1064 states and 1943 transitions. [2019-01-14 04:09:15,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:09:15,293 INFO L706 BuchiCegarLoop]: Abstraction has 1064 states and 1943 transitions. [2019-01-14 04:09:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states and 1943 transitions. [2019-01-14 04:09:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 541. [2019-01-14 04:09:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-01-14 04:09:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 985 transitions. [2019-01-14 04:09:15,325 INFO L729 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-14 04:09:15,325 INFO L609 BuchiCegarLoop]: Abstraction has 541 states and 985 transitions. [2019-01-14 04:09:15,325 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:09:15,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 541 states and 985 transitions. [2019-01-14 04:09:15,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 255 [2019-01-14 04:09:15,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:09:15,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:09:15,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:15,335 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:09:15,336 INFO L794 eck$LassoCheckResult]: Stem: 9580#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;call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(10);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(18);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(16);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(16);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(25);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string42.base, #t~string42.offset, 1);call write~init~int(115, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(10, #t~string42.base, 2 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 3 + #t~string42.offset, 1);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(10);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(34);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(16);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(20);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(21);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(16);~head~0.base, ~head~0.offset := 0, 0;call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(30);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(9);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(21);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(30);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(9);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(21);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(30);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(25);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(30);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(9);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(25);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(44);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(44);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(9);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(9);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(11);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(19);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string137.base, #t~string137.offset, 1);call write~init~int(100, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(10, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string140.base, #t~string140.offset, 1);call write~init~int(100, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(10, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1); 9265#L-1 havoc main_#res;havoc main_#t~ret132, main_~retValue_acc~43, main_~tmp~23;havoc main_~retValue_acc~43;havoc main_~tmp~23; 9266#L1952 havoc valid_product_#res;havoc valid_product_~retValue_acc~34;havoc valid_product_~retValue_acc~34;valid_product_~retValue_acc~34 := 1;valid_product_#res := valid_product_~retValue_acc~34; 9536#L1960 main_#t~ret132 := valid_product_#res;main_~tmp~23 := main_#t~ret132;havoc main_#t~ret132; 9537#L2919 assume 0 != main_~tmp~23;havoc setup_#t~nondet127, setup_#t~nondet129, setup_#t~nondet131, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;havoc setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset;havoc setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset;havoc setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset;~bob~0 := 1;setup_bob_#in~bob___0 := ~bob~0;havoc setup_bob_~bob___0;setup_bob_~bob___0 := setup_bob_#in~bob___0;setup_bob__wrappee__Base_#in~bob___0 := setup_bob_~bob___0;havoc setup_bob__wrappee__Base_~bob___0;setup_bob__wrappee__Base_~bob___0 := setup_bob__wrappee__Base_#in~bob___0;setClientId_#in~handle, setClientId_#in~value := setup_bob__wrappee__Base_~bob___0, setup_bob__wrappee__Base_~bob___0;havoc setClientId_~handle, setClientId_~value;setClientId_~handle := setClientId_#in~handle;setClientId_~value := setClientId_#in~value; 9689#L1102 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 9414#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; 9667#L667 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9403#L673-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string126.base, #t~string126.offset;havoc setup_#t~nondet127;~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; 9680#L1102-2 assume !(1 == setClientId_~handle); 9438#L1105-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 9439#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; 9673#L667-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9417#L673-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string128.base, #t~string128.offset;havoc setup_#t~nondet129;~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; 9668#L1102-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 9349#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; 9634#L667-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9432#L673-8 setup_~__cil_tmp3~4.base, setup_~__cil_tmp3~4.offset := #t~string130.base, #t~string130.offset;havoc setup_#t~nondet131; 9620#L2906 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_#t~nondet35, test_#t~nondet36, test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~op1~0, test_~op2~0, test_~op3~0, test_~op4~0, test_~op5~0, test_~op6~0, test_~op7~0, test_~op8~0, test_~op9~0, test_~op10~0, test_~op11~0, test_~splverifierCounter~0, test_~tmp~7, test_~tmp___0~3, test_~tmp___1~1, test_~tmp___2~1, 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~7;havoc test_~tmp___0~3;havoc test_~tmp___1~1;havoc test_~tmp___2~1;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; 9621#L1477-1 assume !false; 9622#L1329 [2019-01-14 04:09:15,342 INFO L796 eck$LassoCheckResult]: Loop: 9622#L1329 assume test_~splverifierCounter~0 < 4; 9508#L1330 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 9440#L1336 assume !(0 == test_~op1~0); 9442#L1349 assume !(0 == test_~op2~0); 9546#L1360 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet33;havoc test_#t~nondet33; 9554#L1365 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; 9599#L667-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 9334#L673-11 test_~op3~0 := 1; 9320#L1477-1 assume !false; 9622#L1329 [2019-01-14 04:09:15,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:09:15,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:15,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:15,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:09:15,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:09:15,677 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:09:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:09:15,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:09:15,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:09:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:15,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:09:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:09:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:09:16,093 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:09:16,180 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:16,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:16,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:16,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:16,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:09:16,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:16,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:16,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:16,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec27_product34_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:16,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:16,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:16,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:16,560 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:16,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:16,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:09:16,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:09:16,570 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_setClientPrivateKey_#in~value=0, ULTIMATE.start_setClientPrivateKey_~value=0, ~__ste_client_privateKey0~0=0} Honda state: {ULTIMATE.start_setClientPrivateKey_#in~value=0, ULTIMATE.start_setClientPrivateKey_~value=0, ~__ste_client_privateKey0~0=0} 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) [2019-01-14 04:09:16,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:09:16,613 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-01-14 04:09:16,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:09:16,691 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 [2019-01-14 04:09:16,742 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:09:16,743 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:09:16,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:09:16,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:09:16,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:09:16,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:09:16,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:09:16,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:09:16,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:09:16,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec27_product34_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:09:16,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:09:16,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:09:16,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:16,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:09:17,035 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:09:17,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:09:17,244 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:09:17,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:09:17,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:09:17,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:09:17,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:09:17,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:09:17,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:09:17,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:09:17,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:09:17,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:09:17,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:09:17,255 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:09:17,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:09:17,256 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:09:17,257 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:09:17,257 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-14 04:09:17,257 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:09:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:09:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:17,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:09:17,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:09:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:09:17,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:09:17,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446 Second operand 4 states. [2019-01-14 04:09:17,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 541 states and 985 transitions. cyclomatic complexity: 446. Second operand 4 states. Result 1055 states and 1929 transitions. Complement of second has 6 states. [2019-01-14 04:09:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:09:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:09:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2019-01-14 04:09:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:09:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:09:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 515 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:09:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:09:17,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1055 states and 1929 transitions. [2019-01-14 04:09:17,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:17,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1055 states to 0 states and 0 transitions. [2019-01-14 04:09:17,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:17,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:17,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:17,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:17,907 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:17,907 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:09:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:09:17,911 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:09:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:09:17,911 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:09:17,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:09:17,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:09:17,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:17,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:09:17,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:09:17,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:09:17,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:09:17,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:09:17,914 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:17,914 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:17,914 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:09:17,914 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:09:17,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:09:17,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:09:17,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:09:17,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:09:17 BoogieIcfgContainer [2019-01-14 04:09:17,927 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:09:17,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:09:17,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:09:17,928 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:09:17,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:09:11" (3/4) ... [2019-01-14 04:09:17,936 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:09:17,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:09:17,938 INFO L168 Benchmark]: Toolchain (without parser) took 14328.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,940 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:17,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1305.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 256.71 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,943 INFO L168 Benchmark]: Boogie Preprocessor took 248.18 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,944 INFO L168 Benchmark]: RCFGBuilder took 6528.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 277.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,946 INFO L168 Benchmark]: BuchiAutomizer took 5976.54 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 100.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.1 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:09:17,948 INFO L168 Benchmark]: Witness Printer took 8.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:09:17,957 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1305.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 256.71 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 248.18 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6528.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 277.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5976.54 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 100.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.1 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * Witness Printer took 8.42 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 541 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5981 SDtfs, 5480 SDslu, 8051 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: 14ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...