./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8be154d3e1e3530184c878a0d9a3b350197adb1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:26:59,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:26:59,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:26:59,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:26:59,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:26:59,540 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:26:59,541 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:26:59,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:26:59,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:26:59,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:26:59,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:26:59,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:26:59,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:26:59,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:26:59,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:26:59,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:26:59,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:26:59,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:26:59,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:26:59,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:26:59,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:26:59,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:26:59,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:26:59,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:26:59,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:26:59,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:26:59,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:26:59,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:26:59,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:26:59,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:26:59,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:26:59,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:26:59,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:26:59,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:26:59,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:26:59,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:26:59,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:26:59,598 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:26:59,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:26:59,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:26:59,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:26:59,600 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:26:59,600 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:26:59,600 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:26:59,600 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:26:59,601 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:26:59,601 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:26:59,601 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:26:59,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:26:59,601 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:26:59,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:26:59,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:26:59,603 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:26:59,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:26:59,603 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:26:59,603 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:26:59,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:26:59,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:26:59,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:26:59,604 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:26:59,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:26:59,604 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:26:59,604 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:26:59,605 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:26:59,605 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 -> d8be154d3e1e3530184c878a0d9a3b350197adb1 [2019-01-01 23:26:59,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:26:59,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:26:59,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:26:59,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:26:59,671 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:26:59,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c [2019-01-01 23:26:59,726 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec24ab1/e2e78ab01f7b45c5af901e4d26c6cde3/FLAG301cfca11 [2019-01-01 23:27:00,418 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:27:00,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec1_product12_true-unreach-call_true-termination.cil.c [2019-01-01 23:27:00,445 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec24ab1/e2e78ab01f7b45c5af901e4d26c6cde3/FLAG301cfca11 [2019-01-01 23:27:00,578 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbec24ab1/e2e78ab01f7b45c5af901e4d26c6cde3 [2019-01-01 23:27:00,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:27:00,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:27:00,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:27:00,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:27:00,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:27:00,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:27:00" (1/1) ... [2019-01-01 23:27:00,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fee0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:00, skipping insertion in model container [2019-01-01 23:27:00,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:27:00" (1/1) ... [2019-01-01 23:27:00,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:27:00,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:27:01,360 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:27:01,394 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:27:01,666 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:27:01,755 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:27:01,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01 WrapperNode [2019-01-01 23:27:01,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:27:01,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:27:01,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:27:01,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:27:01,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:27:01,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:27:01,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:27:01,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:27:01,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:01,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... [2019-01-01 23:27:02,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:27:02,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:27:02,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:27:02,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:27:02,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-01 23:27:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:27:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:27:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:27:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:27:05,358 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:27:05,358 INFO L280 CfgBuilder]: Removed 227 assue(true) statements. [2019-01-01 23:27:05,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:27:05 BoogieIcfgContainer [2019-01-01 23:27:05,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:27:05,360 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:27:05,360 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:27:05,364 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:27:05,366 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:27:05,366 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:27:00" (1/3) ... [2019-01-01 23:27:05,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e56d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:27:05, skipping insertion in model container [2019-01-01 23:27:05,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:27:05,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:27:01" (2/3) ... [2019-01-01 23:27:05,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e56d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:27:05, skipping insertion in model container [2019-01-01 23:27:05,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:27:05,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:27:05" (3/3) ... [2019-01-01 23:27:05,371 INFO L375 chiAutomizerObserver]: Analyzing ICFG email_spec1_product12_true-unreach-call_true-termination.cil.c [2019-01-01 23:27:05,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:27:05,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:27:05,446 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:27:05,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:27:05,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:27:05,447 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:27:05,447 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:27:05,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:27:05,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:27:05,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 379 states. [2019-01-01 23:27:05,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:27:05,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:27:05,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:27:05,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:27:05,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:27:05,551 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:27:05,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 379 states. [2019-01-01 23:27:05,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:27:05,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:27:05,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:27:05,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:27:05,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:27:05,576 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(44);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(44);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(11);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(19);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string31.base, #t~string31.offset, 1);call write~init~int(100, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(10, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string34.base, #t~string34.offset, 1);call write~init~int(100, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(10, #t~string34.base, 2 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 3 + #t~string34.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(10);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(16);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(20);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string59.base, #t~string59.offset, 1);call write~init~int(115, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(10, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(30);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(9);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(21);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(30);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(9);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(21);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(30);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(9);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(25);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(30);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(9);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(25);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(10);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(12);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(10);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(18);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(16);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(21);~mail_is_sensitive~0 := -1;call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(13); 14#L-1true havoc main_#res;havoc main_#t~nondet25, main_#t~ret26, main_~retValue_acc~2, main_~tmp~2;main_~retValue_acc~2 := main_#t~nondet25;havoc main_#t~nondet25;havoc main_~tmp~2; 10#L296true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 226#L304true main_#t~ret26 := valid_product_#res;main_~tmp~2 := main_#t~ret26;havoc main_#t~ret26; 292#L465true assume 0 != main_~tmp~2;havoc setup_#t~nondet20, setup_#t~nondet22, setup_#t~nondet24, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.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~0.base, setup_~__cil_tmp3~0.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; 5#L1645true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 165#L1651-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; 18#L1210true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 161#L1216-2true setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string19.base, #t~string19.offset;havoc setup_#t~nondet20;~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; 9#L1645-2true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 138#L1651-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; 6#L1210-2true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 167#L1216-5true setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string21.base, #t~string21.offset;havoc setup_#t~nondet22;~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; 187#L1645-4true assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 147#L1651-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; 11#L1210-4true assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 143#L1216-8true setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string23.base, #t~string23.offset;havoc setup_#t~nondet24; 254#L452true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, 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_~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; 80#L229-1true [2019-01-01 23:27:05,577 INFO L796 eck$LassoCheckResult]: Loop: 80#L229-1true assume !false; 15#L87true assume test_~splverifierCounter~0 < 4; 128#L88true test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 261#L94true assume !(0 == test_~op1~0); 319#L107true assume 0 == test_~op2~0;test_~tmp___8~0 := test_#t~nondet1;havoc test_#t~nondet1; 339#L112true assume 0 != test_~tmp___8~0;test_~op2~0 := 1; 80#L229-1true [2019-01-01 23:27:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:05,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1291925977, now seen corresponding path program 1 times [2019-01-01 23:27:05,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:27:05,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:27:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:27:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:27:06,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:27:06,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:27:06,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:27:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 590492675, now seen corresponding path program 1 times [2019-01-01 23:27:06,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:27:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:27:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:06,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:27:06,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:27:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:27:06,201 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:27:06,349 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:27:06,365 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:27:06,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:27:06,367 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:27:06,367 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:27:06,367 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:27:06,367 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:06,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:27:06,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:27:06,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec1_product12_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:27:06,372 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:27:06,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:27:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:06,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:06,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:06,852 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:27:06,984 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:27:06,985 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:06,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:27:06,993 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:07,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:27:07,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:27:07,051 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:27:07,079 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:27:07,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:27:07,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:27:07,079 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:27:07,079 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:27:07,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:07,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:27:07,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:27:07,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec1_product12_true-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:27:07,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:27:07,080 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:27:07,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:07,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:07,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:07,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:07,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:27:07,560 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:27:07,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:27:07,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:07,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:07,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:07,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:07,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:07,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:07,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:07,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:27:07,580 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:27:07,580 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:27:07,582 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:27:07,583 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:27:07,584 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:27:07,584 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~op2~0) = -2*ULTIMATE.start_test_~op2~0 + 1 Supporting invariants [] [2019-01-01 23:27:07,586 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:27:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:07,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:27:08,125 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 23:27:08,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 379 states. Second operand 4 states. [2019-01-01 23:27:08,736 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 379 states.. Second operand 4 states. Result 1572 states and 2764 transitions. Complement of second has 7 states. [2019-01-01 23:27:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:27:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:27:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1528 transitions. [2019-01-01 23:27:08,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1528 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 23:27:08,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:08,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1528 transitions. Stem has 24 letters. Loop has 6 letters. [2019-01-01 23:27:08,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:08,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1528 transitions. Stem has 18 letters. Loop has 12 letters. [2019-01-01 23:27:08,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:08,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1572 states and 2764 transitions. [2019-01-01 23:27:08,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 415 [2019-01-01 23:27:08,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1572 states to 863 states and 1568 transitions. [2019-01-01 23:27:08,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 446 [2019-01-01 23:27:08,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 447 [2019-01-01 23:27:08,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 863 states and 1568 transitions. [2019-01-01 23:27:08,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:27:08,797 INFO L705 BuchiCegarLoop]: Abstraction has 863 states and 1568 transitions. [2019-01-01 23:27:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states and 1568 transitions. [2019-01-01 23:27:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 448. [2019-01-01 23:27:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-01 23:27:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 811 transitions. [2019-01-01 23:27:08,881 INFO L728 BuchiCegarLoop]: Abstraction has 448 states and 811 transitions. [2019-01-01 23:27:08,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:27:08,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:27:08,889 INFO L87 Difference]: Start difference. First operand 448 states and 811 transitions. Second operand 3 states. [2019-01-01 23:27:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:27:09,049 INFO L93 Difference]: Finished difference Result 876 states and 1587 transitions. [2019-01-01 23:27:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:27:09,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 876 states and 1587 transitions. [2019-01-01 23:27:09,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2019-01-01 23:27:09,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 876 states to 876 states and 1587 transitions. [2019-01-01 23:27:09,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 458 [2019-01-01 23:27:09,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 458 [2019-01-01 23:27:09,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 876 states and 1587 transitions. [2019-01-01 23:27:09,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:27:09,072 INFO L705 BuchiCegarLoop]: Abstraction has 876 states and 1587 transitions. [2019-01-01 23:27:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states and 1587 transitions. [2019-01-01 23:27:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 447. [2019-01-01 23:27:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-01-01 23:27:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 807 transitions. [2019-01-01 23:27:09,104 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:27:09,104 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 807 transitions. [2019-01-01 23:27:09,104 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:27:09,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 807 transitions. [2019-01-01 23:27:09,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 [2019-01-01 23:27:09,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:27:09,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:27:09,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:27:09,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:27:09,110 INFO L794 eck$LassoCheckResult]: Stem: 3569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(44);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(44);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(11);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(19);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string31.base, #t~string31.offset, 1);call write~init~int(100, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(10, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string34.base, #t~string34.offset, 1);call write~init~int(100, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(10, #t~string34.base, 2 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 3 + #t~string34.offset, 1);~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(10);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(16);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(20);~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(4);call write~init~int(37, #t~string59.base, #t~string59.offset, 1);call write~init~int(115, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(10, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 3 + #t~string59.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(30);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(9);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(21);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(30);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(9);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(21);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(30);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(9);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(25);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(30);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(9);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(25);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(10);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(12);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(10);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(18);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(16);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(21);~mail_is_sensitive~0 := -1;call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(13); 3387#L-1 havoc main_#res;havoc main_#t~nondet25, main_#t~ret26, main_~retValue_acc~2, main_~tmp~2;main_~retValue_acc~2 := main_#t~nondet25;havoc main_#t~nondet25;havoc main_~tmp~2; 3382#L296 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 3383#L304 main_#t~ret26 := valid_product_#res;main_~tmp~2 := main_#t~ret26;havoc main_#t~ret26; 3782#L465 assume 0 != main_~tmp~2;havoc setup_#t~nondet20, setup_#t~nondet22, setup_#t~nondet24, setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset, setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset, setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.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~0.base, setup_~__cil_tmp3~0.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; 3374#L1645 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 3375#L1651-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; 3398#L1210 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 3399#L1216-2 setup_~__cil_tmp1~0.base, setup_~__cil_tmp1~0.offset := #t~string19.base, #t~string19.offset;havoc setup_#t~nondet20;~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; 3380#L1645-2 assume !(1 == setClientId_~handle); 3381#L1648-2 assume 2 == setClientId_~handle;~__ste_client_idCounter1~0 := setClientId_~value; 3630#L1651-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; 3377#L1210-2 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 3378#L1216-5 setup_~__cil_tmp2~0.base, setup_~__cil_tmp2~0.offset := #t~string21.base, #t~string21.offset;havoc setup_#t~nondet22;~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; 3678#L1645-4 assume 1 == setClientId_~handle;~__ste_client_idCounter0~0 := setClientId_~value; 3632#L1651-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; 3384#L1210-4 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 3385#L1216-8 setup_~__cil_tmp3~0.base, setup_~__cil_tmp3~0.offset := #t~string23.base, #t~string23.offset;havoc setup_#t~nondet24; 3637#L452 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, 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_~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; 3807#L229-1 assume !false; 3388#L87 [2019-01-01 23:27:09,111 INFO L796 eck$LassoCheckResult]: Loop: 3388#L87 assume test_~splverifierCounter~0 < 4; 3389#L88 test_~splverifierCounter~0 := 1 + test_~splverifierCounter~0; 3608#L94 assume !(0 == test_~op1~0); 3394#L107 assume !(0 == test_~op2~0); 3814#L118 assume 0 == test_~op3~0;test_~tmp___7~0 := test_#t~nondet2;havoc test_#t~nondet2; 3818#L123 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; 3718#L1210-6 assume 1 == setClientPrivateKey_~handle;~__ste_client_privateKey0~0 := setClientPrivateKey_~value; 3639#L1216-11 test_~op3~0 := 1; 3503#L229-1 assume !false; 3388#L87 [2019-01-01 23:27:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash -953559564, now seen corresponding path program 1 times [2019-01-01 23:27:09,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:27:09,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:27:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:27:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:27:09,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:27:09,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:27:09,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:27:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1296812605, now seen corresponding path program 1 times [2019-01-01 23:27:09,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:27:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:27:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:27:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:27:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:27:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:27:09,577 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 23:27:09,638 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:27:09,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:27:09,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:27:09,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:27:09,639 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:27:09,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:09,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:27:09,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:27:09,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec1_product12_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:27:09,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:27:09,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:27:09,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,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-01 23:27:09,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:09,977 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:27:09,978 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:09,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:27:09,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:27:10,007 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:27:10,008 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_#t~nondet2=-8, ULTIMATE.start_test_~tmp___7~0=-8} Honda state: {ULTIMATE.start_test_#t~nondet2=-8, ULTIMATE.start_test_~tmp___7~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:10,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:27:10,042 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:10,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:27:10,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:27:10,133 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:27:10,136 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:27:10,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:27:10,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:27:10,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:27:10,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:27:10,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:27:10,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:27:10,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:27:10,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: email_spec1_product12_true-unreach-call_true-termination.cil.c_Iteration2_Loop [2019-01-01 23:27:10,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:27:10,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:27:10,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:27:10,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:27:10,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:27:10,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:27:10,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:27:10,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:27:10,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:27:10,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:27:10,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:27:10,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:27:10,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:27:10,733 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:27:10,736 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:27:10,736 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:27:10,738 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:27:10,738 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:27:10,738 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:27:10,738 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0) = -2*ULTIMATE.start_test_~splverifierCounter~0 + 7 Supporting invariants [] [2019-01-01 23:27:10,738 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:27:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:27:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:10,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:27:10,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:27:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:27:11,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:27:11,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362 Second operand 4 states. [2019-01-01 23:27:11,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 807 transitions. cyclomatic complexity: 362. Second operand 4 states. Result 867 states and 1573 transitions. Complement of second has 6 states. [2019-01-01 23:27:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:27:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:27:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2019-01-01 23:27:11,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 9 letters. [2019-01-01 23:27:11,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:11,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 29 letters. Loop has 9 letters. [2019-01-01 23:27:11,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:11,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 426 transitions. Stem has 20 letters. Loop has 18 letters. [2019-01-01 23:27:11,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:27:11,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 867 states and 1573 transitions. [2019-01-01 23:27:11,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:11,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 867 states to 0 states and 0 transitions. [2019-01-01 23:27:11,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:27:11,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:27:11,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:27:11,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:27:11,400 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:11,400 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:27:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:27:11,403 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 23:27:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:27:11,403 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:27:11,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:27:11,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:27:11,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:11,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:27:11,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:27:11,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:27:11,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:27:11,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:27:11,407 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:11,407 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:11,407 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:27:11,407 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:27:11,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:27:11,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:27:11,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:27:11,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:27:11 BoogieIcfgContainer [2019-01-01 23:27:11,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:27:11,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:27:11,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:27:11,419 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:27:11,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:27:05" (3/4) ... [2019-01-01 23:27:11,425 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:27:11,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:27:11,428 INFO L168 Benchmark]: Toolchain (without parser) took 10846.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -61.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:11,431 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:27:11,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1169.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:11,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.34 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-01 23:27:11,437 INFO L168 Benchmark]: Boogie Preprocessor took 145.94 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-01 23:27:11,438 INFO L168 Benchmark]: RCFGBuilder took 3338.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 928.2 MB in the end (delta: 164.3 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:11,441 INFO L168 Benchmark]: BuchiAutomizer took 6056.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 928.2 MB in the beginning and 1.0 GB in the end (delta: -77.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:27:11,442 INFO L168 Benchmark]: Witness Printer took 9.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:27:11,448 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.17 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 1169.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.34 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. * Boogie Preprocessor took 145.94 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 3338.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 928.2 MB in the end (delta: 164.3 MB). Peak memory consumption was 164.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6056.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 928.2 MB in the beginning and 1.0 GB in the end (delta: -77.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.61 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * op2 + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 844 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 447 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2520 SDtfs, 2108 SDslu, 2993 SDs, 0 SdLazy, 26 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf90 smp100 dnf134 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 22ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...