./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec9_product31_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_spec9_product31_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1eae6ad1342b577ea984e6a37480cc6b6c7e7ce ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11:30,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:11:30,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:11:30,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:11:30,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:11:30,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:11:30,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:11:30,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:11:30,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:11:30,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:11:30,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:11:30,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:11:30,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:11:30,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:11:30,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:11:30,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:11:30,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:11:30,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:11:30,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:11:30,567 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:11:30,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:11:30,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:11:30,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:11:30,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:11:30,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:11:30,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:11:30,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:11:30,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:11:30,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:11:30,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:11:30,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:11:30,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:11:30,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:11:30,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:11:30,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:11:30,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:11:30,581 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:11:30,598 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:11:30,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:11:30,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:11:30,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:11:30,600 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:11:30,600 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:11:30,601 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:11:30,601 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:11:30,601 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:11:30,601 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:11:30,601 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:11:30,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:11:30,602 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:11:30,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:11:30,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:11:30,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:11:30,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:11:30,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:11:30,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:11:30,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:11:30,603 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:11:30,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:11:30,604 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:11:30,604 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:11:30,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:11:30,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:11:30,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:11:30,605 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:11:30,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:11:30,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:11:30,605 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:11:30,606 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:11:30,606 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 -> e1eae6ad1342b577ea984e6a37480cc6b6c7e7ce [2019-01-14 04:11:30,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:11:30,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:11:30,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:11:30,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:11:30,679 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:11:30,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec9_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:11:30,743 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77fca96d/81b6eb9d44874cc58e2b910472bdfbe0/FLAG826074b68 [2019-01-14 04:11:31,313 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:11:31,314 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec9_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:11:31,347 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77fca96d/81b6eb9d44874cc58e2b910472bdfbe0/FLAG826074b68 [2019-01-14 04:11:31,528 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77fca96d/81b6eb9d44874cc58e2b910472bdfbe0 [2019-01-14 04:11:31,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:11:31,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:11:31,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:11:31,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:11:31,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:11:31,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:11:31" (1/1) ... [2019-01-14 04:11:31,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56746068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:31, skipping insertion in model container [2019-01-14 04:11:31,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:11:31" (1/1) ... [2019-01-14 04:11:31,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:11:31,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:11:32,400 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:11:32,519 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:11:32,689 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:11:32,799 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:11:32,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32 WrapperNode [2019-01-14 04:11:32,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:11:32,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:11:32,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:11:32,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:11:32,814 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:11:32" (1/1) ... [2019-01-14 04:11:32,881 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:11:32" (1/1) ... [2019-01-14 04:11:33,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:11:33,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:11:33,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:11:33,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:11:33,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (1/1) ... [2019-01-14 04:11:33,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:11:33,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:11:33,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:11:33,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:11:33,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (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:11:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-14 04:11:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:11:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:11:33,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:11:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:11:36,566 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:11:36,566 INFO L286 CfgBuilder]: Removed 379 assue(true) statements. [2019-01-14 04:11:36,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:11:36 BoogieIcfgContainer [2019-01-14 04:11:36,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:11:36,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:11:36,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:11:36,573 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:11:36,574 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:11:36,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:11:31" (1/3) ... [2019-01-14 04:11:36,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30aa379d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:11:36, skipping insertion in model container [2019-01-14 04:11:36,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:11:36,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:11:32" (2/3) ... [2019-01-14 04:11:36,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30aa379d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:11:36, skipping insertion in model container [2019-01-14 04:11:36,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:11:36,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:11:36" (3/3) ... [2019-01-14 04:11:36,579 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec9_product31_false-unreach-call_true-termination.cil.c [2019-01-14 04:11:36,642 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:11:36,642 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:11:36,643 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:11:36,643 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:11:36,643 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:11:36,643 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:11:36,643 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:11:36,643 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:11:36,643 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:11:36,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 565 states. [2019-01-14 04:11:36,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:11:36,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:11:36,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:11:36,770 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:11:36,770 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:11:36,771 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:11:36,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 565 states. [2019-01-14 04:11:36,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:11:36,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:11:36,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:11:36,789 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:11:36,789 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:11:36,796 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string0.base, #t~string0.offset, 1);call write~init~int(115, #t~string0.base, 1 + #t~string0.offset, 1);call write~init~int(10, #t~string0.base, 2 + #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 3 + #t~string0.offset, 1);~__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;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~__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;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(10);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(16);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(20);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(44);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(44);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(9);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(9);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(11);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(19);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string95.base, #t~string95.offset, 1);call write~init~int(100, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(10, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string98.base, #t~string98.offset, 1);call write~init~int(100, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(10, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);~in_encrypted~0 := 0;call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(17);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(17);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(13);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(17);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(12);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(10);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(18);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(21);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(13);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(16);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(25); 271#L-1true havoc main_#res;havoc main_#t~ret90, main_~retValue_acc~39, main_~tmp~16;havoc main_~retValue_acc~39;havoc main_~tmp~16; 98#L93true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 262#L101true main_#t~ret90 := valid_product_#res;main_~tmp~16 := main_#t~ret90;havoc main_#t~ret90; 524#L2706true assume 0 != main_~tmp~16;havoc setup_#t~nondet85, setup_#t~nondet87, setup_#t~nondet89, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.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~3.base, setup_~__cil_tmp3~3.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; 223#L2172true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 351#L2178-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; 523#L1737true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 32#L1743-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string84.base, #t~string84.offset;havoc setup_#t~nondet85;~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; 226#L2172-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 330#L2178-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; 525#L1737-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 38#L1743-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string86.base, #t~string86.offset;havoc setup_#t~nondet87;~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; 208#L2172-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 338#L2178-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; 534#L1737-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 20#L1743-8true setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset := #t~string88.base, #t~string88.offset;havoc setup_#t~nondet89; 466#L2693true havoc test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, 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~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 564#L712-1true [2019-01-14 04:11:36,797 INFO L796 eck$LassoCheckResult]: Loop: 564#L712-1true assume !false; 70#L567true assume test_~splverifierCounter~0 < 4; 449#L568true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 143#L574true assume !(0 == test_~op1~0); 37#L587true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet4;havoc test_#t~nondet4; 533#L592true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 564#L712-1true [2019-01-14 04:11:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-14 04:11:36,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:11:36,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:11:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:11:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:37,232 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:11:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:11:37,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:11:37,239 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:11:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-14 04:11:37,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:11:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:11:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:37,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:11:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:11:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:11:37,459 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:11:37,574 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:11:37,586 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:11:37,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:11:37,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:11:37,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:11:37,588 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:11:37,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:37,588 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:11:37,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:11:37,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec9_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:11:37,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:11:37,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:11:37,618 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:11:37,716 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:11:37,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:11:37,962 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:11:38,281 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:11:38,401 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:11:38,659 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:11:38,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:11:38,673 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:11:38,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:11:38,687 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:38,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:11:38,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:11:38,735 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:11:38,753 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:11:38,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:11:38,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:11:38,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:11:38,754 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:11:38,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:38,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:11:38,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:11:38,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec9_product31_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:11:38,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:11:38,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:11:38,756 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:11:38,770 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:11:38,777 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:11:38,789 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:11:38,928 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:11:39,045 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:11:39,213 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 04:11:39,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:11:39,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:11:39,466 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:11:39,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:11:39,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:11:39,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:11:39,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:11:39,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:11:39,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:11:39,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:11:39,479 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:11:39,484 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:11:39,485 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:11:39,487 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:11:39,487 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:11:39,489 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:11:39,489 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:11:39,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:11:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:39,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:11:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:39,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:11:39,935 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:11:39,955 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:11:39,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 565 states. Second operand 4 states. [2019-01-14 04:11:40,461 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 565 states.. Second operand 4 states. Result 2498 states and 4292 transitions. Complement of second has 7 states. [2019-01-14 04:11:40,462 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:11:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:11:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2442 transitions. [2019-01-14 04:11:40,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2442 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 04:11:40,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:40,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2442 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-14 04:11:40,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:40,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 2442 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-14 04:11:40,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:40,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2498 states and 4292 transitions. [2019-01-14 04:11:40,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 423 [2019-01-14 04:11:40,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2498 states to 879 states and 1596 transitions. [2019-01-14 04:11:40,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-14 04:11:40,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2019-01-14 04:11:40,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1596 transitions. [2019-01-14 04:11:40,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:11:40,535 INFO L706 BuchiCegarLoop]: Abstraction has 879 states and 1596 transitions. [2019-01-14 04:11:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1596 transitions. [2019-01-14 04:11:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 456. [2019-01-14 04:11:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-14 04:11:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 825 transitions. [2019-01-14 04:11:40,619 INFO L729 BuchiCegarLoop]: Abstraction has 456 states and 825 transitions. [2019-01-14 04:11:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:11:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:11:40,625 INFO L87 Difference]: Start difference. First operand 456 states and 825 transitions. Second operand 3 states. [2019-01-14 04:11:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:11:40,868 INFO L93 Difference]: Finished difference Result 892 states and 1615 transitions. [2019-01-14 04:11:40,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:11:40,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 892 states and 1615 transitions. [2019-01-14 04:11:40,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 424 [2019-01-14 04:11:40,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 892 states to 892 states and 1615 transitions. [2019-01-14 04:11:40,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2019-01-14 04:11:40,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2019-01-14 04:11:40,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 892 states and 1615 transitions. [2019-01-14 04:11:40,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:11:40,910 INFO L706 BuchiCegarLoop]: Abstraction has 892 states and 1615 transitions. [2019-01-14 04:11:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states and 1615 transitions. [2019-01-14 04:11:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 455. [2019-01-14 04:11:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-14 04:11:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 821 transitions. [2019-01-14 04:11:40,942 INFO L729 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:11:40,942 INFO L609 BuchiCegarLoop]: Abstraction has 455 states and 821 transitions. [2019-01-14 04:11:40,942 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:11:40,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 821 transitions. [2019-01-14 04:11:40,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 212 [2019-01-14 04:11:40,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:11:40,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:11:40,948 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:11:40,948 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:11:40,948 INFO L794 eck$LassoCheckResult]: Stem: 4812#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string0.base, #t~string0.offset, 1);call write~init~int(115, #t~string0.base, 1 + #t~string0.offset, 1);call write~init~int(10, #t~string0.base, 2 + #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 3 + #t~string0.offset, 1);~__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;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~__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;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(10);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(16);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(20);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(44);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(44);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(9);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(9);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(11);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(19);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string95.base, #t~string95.offset, 1);call write~init~int(100, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(10, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string98.base, #t~string98.offset, 1);call write~init~int(100, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(10, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);~in_encrypted~0 := 0;call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(17);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(17);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(13);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(17);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(12);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(10);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(18);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(16);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(21);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(13);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(16);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(25); 4516#L-1 havoc main_#res;havoc main_#t~ret90, main_~retValue_acc~39, main_~tmp~16;havoc main_~retValue_acc~39;havoc main_~tmp~16; 4517#L93 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 4853#L101 main_#t~ret90 := valid_product_#res;main_~tmp~16 := main_#t~ret90;havoc main_#t~ret90; 4960#L2706 assume 0 != main_~tmp~16;havoc setup_#t~nondet85, setup_#t~nondet87, setup_#t~nondet89, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.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~3.base, setup_~__cil_tmp3~3.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; 4961#L2172 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4727#L2178-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; 4753#L1737 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4736#L1743-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string84.base, #t~string84.offset;havoc setup_#t~nondet85;~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; 4737#L2172-2 assume !(1 == setClientId_~handle); 4952#L2175-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 4697#L2178-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; 4698#L1737-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4739#L1743-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string86.base, #t~string86.offset;havoc setup_#t~nondet87;~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; 4750#L2172-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 4708#L2178-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; 4711#L1737-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4693#L1743-8 setup_~__cil_tmp3~3.base, setup_~__cil_tmp3~3.offset := #t~string88.base, #t~string88.offset;havoc setup_#t~nondet89; 4696#L2693 havoc test_#t~nondet3, test_#t~nondet4, test_#t~nondet5, test_#t~nondet6, test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, 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~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0, test_~tmp___3~0, test_~tmp___4~0, test_~tmp___5~0, test_~tmp___6~0, test_~tmp___7~0, test_~tmp___8~0, test_~tmp___9~0;havoc test_~op1~0;havoc test_~op2~0;havoc test_~op3~0;havoc test_~op4~0;havoc test_~op5~0;havoc test_~op6~0;havoc test_~op7~0;havoc test_~op8~0;havoc test_~op9~0;havoc test_~op10~0;havoc test_~op11~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;havoc test_~tmp___3~0;havoc test_~tmp___4~0;havoc test_~tmp___5~0;havoc test_~tmp___6~0;havoc test_~tmp___7~0;havoc test_~tmp___8~0;havoc test_~tmp___9~0;test_~op1~0 := 0;test_~op2~0 := 0;test_~op3~0 := 0;test_~op4~0 := 0;test_~op5~0 := 0;test_~op6~0 := 0;test_~op7~0 := 0;test_~op8~0 := 0;test_~op9~0 := 0;test_~op10~0 := 0;test_~op11~0 := 0;test_~splverifierCounter~0 := 0; 4942#L712-1 assume !false; 4798#L567 [2019-01-14 04:11:40,948 INFO L796 eck$LassoCheckResult]: Loop: 4798#L567 assume test_~splverifierCounter~0 < 4; 4799#L568 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 4918#L574 assume !(0 == test_~op1~0); 4746#L587 assume !(0 == test_~op2~0); 4740#L598 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet5;havoc test_#t~nondet5; 4742#L603 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; 4956#L1737-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 4606#L1743-11 test_~op3~0 := 1; 4533#L712-1 assume !false; 4798#L567 [2019-01-14 04:11:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:40,955 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-14 04:11:40,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:11:40,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:11:40,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:40,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:11:40,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:41,208 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:11:41,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:11:41,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:11:41,209 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:11:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-14 04:11:41,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:11:41,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:11:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:41,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:11:41,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:11:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:11:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:11:41,378 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 04:11:41,464 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:11:41,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:11:41,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:11:41,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:11:41,464 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:11:41,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:41,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:11:41,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:11:41,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec9_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:11:41,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:11:41,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:11:41,467 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:11:41,480 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:11:41,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:11:41,508 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:11:41,518 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:11:41,521 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:11:41,531 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:11:41,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:11:41,716 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:11:41,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:11:41,720 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:41,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:11:41,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:11:41,766 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:11:41,768 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:11:41,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:11:41,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:11:41,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:11:41,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:11:41,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:11:41,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:11:41,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:11:41,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec9_product31_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-14 04:11:41,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:11:41,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:11:41,774 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:11:41,783 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:11:41,793 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:11:41,796 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:11:41,805 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:11:41,809 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:11:41,819 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:11:41,981 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:11:41,982 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:11:41,982 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:11:41,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:11:41,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:11:41,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:11:41,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:11:41,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:11:41,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:11:41,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:11:41,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:11:41,993 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:11:41,993 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:11:41,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:11:41,994 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:11:41,995 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:11:41,995 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:11:41,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:11:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:11:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:42,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:11:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:11:42,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:11:42,406 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:11:42,407 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:11:42,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368 Second operand 4 states. [2019-01-14 04:11:42,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 821 transitions. cyclomatic complexity: 368. Second operand 4 states. Result 883 states and 1601 transitions. Complement of second has 6 states. [2019-01-14 04:11:42,508 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:11:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:11:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2019-01-14 04:11:42,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-14 04:11:42,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:42,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-14 04:11:42,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:42,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 433 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-14 04:11:42,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:11:42,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1601 transitions. [2019-01-14 04:11:42,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:11:42,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 0 states and 0 transitions. [2019-01-14 04:11:42,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:11:42,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:11:42,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:11:42,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:11:42,524 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:11:42,524 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:11:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:11:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:11:42,525 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-14 04:11:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:11:42,525 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:11:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:11:42,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:11:42,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:11:42,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:11:42,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:11:42,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:11:42,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:11:42,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:11:42,529 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:11:42,529 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:11:42,529 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:11:42,529 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:11:42,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:11:42,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:11:42,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:11:42,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:11:42 BoogieIcfgContainer [2019-01-14 04:11:42,539 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:11:42,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:11:42,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:11:42,540 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:11:42,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:11:36" (3/4) ... [2019-01-14 04:11:42,546 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:11:42,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:11:42,547 INFO L168 Benchmark]: Toolchain (without parser) took 11013.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 946.0 MB in the beginning and 893.3 MB in the end (delta: 52.7 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,549 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:11:42,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1264.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 204.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,553 INFO L168 Benchmark]: Boogie Preprocessor took 132.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,553 INFO L168 Benchmark]: RCFGBuilder took 3429.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.6 MB in the end (delta: 234.0 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,555 INFO L168 Benchmark]: BuchiAutomizer took 5970.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.3 MB). Free memory was 823.6 MB in the beginning and 893.3 MB in the end (delta: -69.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:11:42,556 INFO L168 Benchmark]: Witness Printer took 6.44 ms. Allocated memory is still 1.3 GB. Free memory is still 893.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:11:42,563 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1264.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 204.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3429.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.6 MB in the end (delta: 234.0 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5970.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.3 MB). Free memory was 823.6 MB in the beginning and 893.3 MB in the end (delta: -69.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.44 ms. Allocated memory is still 1.3 GB. Free memory is still 893.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 860 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 455 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3155 SDtfs, 2736 SDslu, 3935 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...