./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer --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 64bit --witnessprinter.graph.data.programhash 7360833afd5a8b935377ce87ce4cc4a6584d3d0c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:52,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:52,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:52,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:52,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:52,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:52,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:52,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:52,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:52,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:52,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:52,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:52,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:52,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:52,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:52,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:52,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:52,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:52,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:52,750 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:52,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:52,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:52,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:52,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:52,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:52,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:52,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:52,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:52,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:52,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:52,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:52,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:52,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:52,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:52,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:52,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:52,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:52,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:52,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:52,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:52,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:52,781 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:52,781 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:52,781 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:52,782 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:52,783 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:52,783 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:52,783 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:52,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:52,783 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:52,783 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:52,784 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:52,785 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:52,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:52,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:52,785 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:52,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:52,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:52,786 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:52,789 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:52,789 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7360833afd5a8b935377ce87ce4cc4a6584d3d0c [2018-10-27 06:06:52,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:52,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:52,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:52,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:52,837 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:52,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2018-10-27 06:06:52,893 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/data/9d0d80cd6/da794c62254c447099497d2755fe9b9f/FLAG32ba42eb2 [2018-10-27 06:06:53,350 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:53,351 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2018-10-27 06:06:53,363 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/data/9d0d80cd6/da794c62254c447099497d2755fe9b9f/FLAG32ba42eb2 [2018-10-27 06:06:53,377 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/data/9d0d80cd6/da794c62254c447099497d2755fe9b9f [2018-10-27 06:06:53,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:53,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:53,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:53,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:53,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:53,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162bd212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53, skipping insertion in model container [2018-10-27 06:06:53,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:53,438 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:53,685 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:53,694 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:53,733 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:53,772 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:53,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53 WrapperNode [2018-10-27 06:06:53,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:53,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:53,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:53,773 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:53,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:53,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:53,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:53,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:53,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... [2018-10-27 06:06:53,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:53,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:53,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:53,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:53,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_96bc9c2f-9e62-4e52-9386-712a61beabae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:54,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:54,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:54,495 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:54,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:54 BoogieIcfgContainer [2018-10-27 06:06:54,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:54,497 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:54,497 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:54,500 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:54,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:54,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:53" (1/3) ... [2018-10-27 06:06:54,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12643232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:54, skipping insertion in model container [2018-10-27 06:06:54,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:54,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:53" (2/3) ... [2018-10-27 06:06:54,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12643232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:54, skipping insertion in model container [2018-10-27 06:06:54,503 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:54,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:54" (3/3) ... [2018-10-27 06:06:54,505 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-termination.c.i [2018-10-27 06:06:54,560 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:54,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:54,561 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:54,561 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:54,561 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:54,561 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:54,561 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:54,561 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:54,561 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:54,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:06:54,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:54,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:06:54,601 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:54,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-10-27 06:06:54,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-10-27 06:06:54,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:54,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:54,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:54,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-10-27 06:06:54,611 INFO L793 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13.base, main_#t~ret13.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length2~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~n~0 := main_#t~nondet10;havoc main_#t~nondet10; 3#L568true assume !(main_~length1~0 < 1); 4#L568-2true assume !(main_~length2~0 < 1); 27#L571-1true assume !(main_~n~0 < 1); 8#L574-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 15#L580true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L580 16#L580-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L580-1 13#L581true assume { :begin_inline_cstrncat } true;cstrncat_#in~dst.base, cstrncat_#in~dst.offset, cstrncat_#in~src.base, cstrncat_#in~src.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post5.base, cstrncat_#t~post5.offset, cstrncat_#t~mem6, cstrncat_#t~post7.base, cstrncat_#t~post7.offset, cstrncat_#t~pre4, cstrncat_~d~0.base, cstrncat_~d~0.offset, cstrncat_~s~0.base, cstrncat_~s~0.offset, cstrncat_~dst.base, cstrncat_~dst.offset, cstrncat_~src.base, cstrncat_~src.offset, cstrncat_~n;cstrncat_~dst.base, cstrncat_~dst.offset := cstrncat_#in~dst.base, cstrncat_#in~dst.offset;cstrncat_~src.base, cstrncat_~src.offset := cstrncat_#in~src.base, cstrncat_#in~src.offset;cstrncat_~n := cstrncat_#in~n; 11#L550true assume cstrncat_~n % 4294967296 != 0;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_~dst.base, cstrncat_~dst.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~src.base, cstrncat_~src.offset; 26#L553-4true [2018-10-27 06:06:54,612 INFO L795 eck$LassoCheckResult]: Loop: 26#L553-4true assume true; 21#L553-1true SUMMARY for call cstrncat_#t~mem2 := read~int(cstrncat_~d~0.base, cstrncat_~d~0.offset, 1); srcloc: L553-1 24#L553-2true assume !!(cstrncat_#t~mem2 != 0);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~d~0.base, cstrncat_~d~0.offset;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_#t~post3.base, cstrncat_#t~post3.offset + 1;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 26#L553-4true [2018-10-27 06:06:54,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1713334035, now seen corresponding path program 1 times [2018-10-27 06:06:54,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 64615, now seen corresponding path program 1 times [2018-10-27 06:06:54,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 542925845, now seen corresponding path program 1 times [2018-10-27 06:06:54,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:54,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:54,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:55,944 WARN L179 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2018-10-27 06:06:56,295 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-27 06:06:56,309 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:56,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:56,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:56,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:56,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:56,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:56,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:56,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:56,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncat-alloca_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:06:56,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:56,313 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:56,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,806 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2018-10-27 06:06:56,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:56,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:57,157 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-10-27 06:06:57,530 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:57,535 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:57,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:57,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:57,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:57,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:57,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:57,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:57,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:57,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:57,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:57,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:57,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:57,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:57,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:57,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:57,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:57,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:57,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:57,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:57,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:57,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:57,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:57,702 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:06:57,702 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:06:57,704 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:57,706 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:57,707 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:57,707 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrncat_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrncat_~d~0.offset Supporting invariants [] [2018-10-27 06:06:57,957 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:06:57,962 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:06:57,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:58,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:58,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:58,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:06:58,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 6 states. [2018-10-27 06:06:58,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 6 states. Result 61 states and 76 transitions. Complement of second has 10 states. [2018-10-27 06:06:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:06:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2018-10-27 06:06:58,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 10 letters. Loop has 3 letters. [2018-10-27 06:06:58,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:58,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 13 letters. Loop has 3 letters. [2018-10-27 06:06:58,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:58,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 54 transitions. Stem has 10 letters. Loop has 6 letters. [2018-10-27 06:06:58,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:58,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2018-10-27 06:06:58,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:58,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2018-10-27 06:06:58,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:58,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:58,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:58,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:58,264 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:58,264 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:58,264 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:58,264 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:58,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:58,265 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:58,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:58,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:58 BoogieIcfgContainer [2018-10-27 06:06:58,272 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:58,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:58,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:58,273 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:58,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:54" (3/4) ... [2018-10-27 06:06:58,277 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:58,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:58,278 INFO L168 Benchmark]: Toolchain (without parser) took 4897.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,279 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:58,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -209.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,280 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,281 INFO L168 Benchmark]: RCFGBuilder took 561.92 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,281 INFO L168 Benchmark]: BuchiAutomizer took 3775.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:58,282 INFO L168 Benchmark]: Witness Printer took 4.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:58,287 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 928.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -209.7 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.01 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 561.92 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3775.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 75.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * d and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 34 SDslu, 34 SDs, 0 SdLazy, 26 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital218 mio100 ax108 hnf98 lsp89 ukn92 mio100 lsp42 div146 bol100 ite100 ukn100 eq177 hnf74 smp95 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...