./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-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_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/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 51c86dc5019658537c4cb35ed62637baeb91c588 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:44:57,753 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:44:57,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:44:57,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:44:57,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:44:57,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:44:57,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:44:57,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:44:57,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:44:57,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:44:57,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:44:57,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:44:57,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:44:57,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:44:57,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:44:57,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:44:57,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:44:57,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:44:57,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:44:57,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:44:57,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:44:57,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:44:57,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:44:57,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:44:57,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:44:57,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:44:57,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:44:57,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:44:57,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:44:57,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:44:57,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:44:57,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:44:57,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:44:57,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:44:57,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:44:57,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:44:57,779 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:44:57,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:44:57,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:44:57,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:44:57,789 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:44:57,789 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:44:57,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:44:57,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:44:57,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:44:57,791 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:44:57,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:44:57,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:44:57,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:44:57,791 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:44:57,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:44:57,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:44:57,792 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:44:57,792 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:44:57,793 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_f74c62c5-d117-4df7-9eb1-cd032b46d54e/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 -> 51c86dc5019658537c4cb35ed62637baeb91c588 [2018-11-10 07:44:57,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:44:57,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:44:57,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:44:57,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:44:57,834 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:44:57,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-10 07:44:57,881 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/data/5caa37a88/b9c91b9b66854aceb78e4cd66e06f485/FLAGaaefe5c51 [2018-11-10 07:44:58,233 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:44:58,233 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-10 07:44:58,244 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/data/5caa37a88/b9c91b9b66854aceb78e4cd66e06f485/FLAGaaefe5c51 [2018-11-10 07:44:58,255 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/bin-2019/uautomizer/data/5caa37a88/b9c91b9b66854aceb78e4cd66e06f485 [2018-11-10 07:44:58,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:44:58,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:44:58,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:44:58,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:44:58,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:44:58,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5faa3d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58, skipping insertion in model container [2018-11-10 07:44:58,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:44:58,298 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:44:58,482 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:44:58,490 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:44:58,518 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:44:58,553 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:44:58,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58 WrapperNode [2018-11-10 07:44:58,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:44:58,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:44:58,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:44:58,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:44:58,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:44:58,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:44:58,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:44:58,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:44:58,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... [2018-11-10 07:44:58,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:44:58,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:44:58,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:44:58,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:44:58,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f74c62c5-d117-4df7-9eb1-cd032b46d54e/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-11-10 07:44:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:44:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:44:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:44:58,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:44:58,884 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:44:58,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:58 BoogieIcfgContainer [2018-11-10 07:44:58,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:44:58,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:44:58,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:44:58,888 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:44:58,889 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:44:58,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:44:58" (1/3) ... [2018-11-10 07:44:58,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dd193ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:44:58, skipping insertion in model container [2018-11-10 07:44:58,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:44:58,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:58" (2/3) ... [2018-11-10 07:44:58,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dd193ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:44:58, skipping insertion in model container [2018-11-10 07:44:58,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:44:58,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:58" (3/3) ... [2018-11-10 07:44:58,892 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-termination.c.i [2018-11-10 07:44:58,933 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:44:58,933 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:44:58,933 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:44:58,933 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:44:58,934 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:44:58,934 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:44:58,934 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:44:58,934 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:44:58,934 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:44:58,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 07:44:58,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:44:58,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:44:58,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:44:58,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:44:58,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:44:58,962 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:44:58,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 07:44:58,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:44:58,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:44:58,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:44:58,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:44:58,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:44:58,971 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 5#L566true assume !(main_~length~0 < 1); 11#L566-2true assume !(main_~n~0 < 1); 3#L569-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 14#L574true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L574 18#L574-1true assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 23#L550true assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 25#L553-4true [2018-11-10 07:44:58,971 INFO L795 eck$LassoCheckResult]: Loop: 25#L553-4true assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 8#L554true SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L554 12#L554-1true SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L554-1 16#L554-2true assume !(cstrncpy_#t~mem5 == 0);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 17#L553-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 20#L553-2true assume !!(cstrncpy_#t~pre2 % 4294967296 != 0);havoc cstrncpy_#t~pre2; 25#L553-4true [2018-11-10 07:44:58,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:44:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash 180425517, now seen corresponding path program 1 times [2018-11-10 07:44:58,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:44:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:44:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:44:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:44:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1598512636, now seen corresponding path program 1 times [2018-11-10 07:44:59,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:44:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:44:59,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:44:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:44:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1019191256, now seen corresponding path program 1 times [2018-11-10 07:44:59,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:44:59,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:44:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:44:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:44:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:44:59,511 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-11-10 07:44:59,614 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-10 07:44:59,621 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:44:59,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:44:59,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:44:59,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:44:59,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:44:59,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:44:59,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:44:59,623 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:44:59,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 07:44:59,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:44:59,624 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:44:59,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:44:59,970 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-11-10 07:45:00,117 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-11-10 07:45:00,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:00,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:00,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:00,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:00,364 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-11-10 07:45:00,750 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:45:00,754 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:45:00,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:00,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:00,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:00,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:00,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:00,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:00,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:00,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:00,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:00,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:00,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:00,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:45:00,968 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:45:00,968 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 07:45:00,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:45:00,971 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:45:00,971 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:45:00,972 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-10 07:45:01,028 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 07:45:01,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:45:01,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:01,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:01,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:01,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 07:45:01,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 6 states. [2018-11-10 07:45:01,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 6 states. Result 49 states and 58 transitions. Complement of second has 10 states. [2018-11-10 07:45:01,229 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-11-10 07:45:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 07:45:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-10 07:45:01,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 07:45:01,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:01,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 07:45:01,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:01,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-10 07:45:01,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:01,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2018-11-10 07:45:01,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:45:01,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 21 states and 24 transitions. [2018-11-10 07:45:01,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 07:45:01,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 07:45:01,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 07:45:01,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:01,240 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 07:45:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 07:45:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-10 07:45:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 07:45:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-10 07:45:01,257 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 07:45:01,257 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 07:45:01,257 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:45:01,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-10 07:45:01,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:45:01,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:45:01,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:45:01,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:45:01,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:45:01,258 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 212#L566 assume !(main_~length~0 < 1); 213#L566-2 assume !(main_~n~0 < 1); 208#L569-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 209#L574 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L574 221#L574-1 assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 225#L550 assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 227#L553-4 assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 215#L554 SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L554 216#L554-1 SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L554-1 220#L554-2 assume cstrncpy_#t~mem5 == 0;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 214#L555-4 [2018-11-10 07:45:01,258 INFO L795 eck$LassoCheckResult]: Loop: 214#L555-4 assume true; 217#L555-1 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 218#L555-2 assume !!(cstrncpy_#t~pre6 % 4294967296 != 0);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset + 1; 210#L556 SUMMARY for call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1); srcloc: L556 211#L556-1 havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 214#L555-4 [2018-11-10 07:45:01,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -796590415, now seen corresponding path program 1 times [2018-11-10 07:45:01,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:01,285 INFO L82 PathProgramCache]: Analyzing trace with hash 60187782, now seen corresponding path program 1 times [2018-11-10 07:45:01,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:01,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:01,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2133519402, now seen corresponding path program 1 times [2018-11-10 07:45:01,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:45:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:45:01,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:45:01,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:45:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:45:01,743 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 128 [2018-11-10 07:45:01,875 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 07:45:01,876 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:45:01,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:45:01,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:45:01,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:45:01,876 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:45:01,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:45:01,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:45:01,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:45:01,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 07:45:01,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:45:01,877 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:45:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,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-11-10 07:45:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,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-11-10 07:45:01,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-11-10 07:45:01,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,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-11-10 07:45:01,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,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-11-10 07:45:01,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-11-10 07:45:01,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:45:01,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-11-10 07:45:02,221 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-10 07:45:02,599 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-10 07:45:02,705 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-10 07:45:03,000 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:45:03,000 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:45:03,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:45:03,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:45:03,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:45:03,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:45:03,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:45:03,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:45:03,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:45:03,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:45:03,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:45:03,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:45:03,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:45:03,112 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:45:03,130 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 07:45:03,130 INFO L444 ModelExtractionUtils]: 68 out of 73 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 07:45:03,131 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:45:03,132 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:45:03,132 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:45:03,132 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~d~0.base)_2 Supporting invariants [] [2018-11-10 07:45:03,185 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 07:45:03,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 07:45:03,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:45:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:03,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:03,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:45:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:03,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 07:45:03,270 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 07:45:03,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2018-11-10 07:45:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:45:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 07:45:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-11-10 07:45:03,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 07:45:03,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:03,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 07:45:03,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:03,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 07:45:03,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:45:03,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-10 07:45:03,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:45:03,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-10 07:45:03,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:45:03,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:45:03,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:45:03,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:45:03,289 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:45:03,289 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:45:03,289 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:45:03,289 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:45:03,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:45:03,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:45:03,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:45:03,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:45:03 BoogieIcfgContainer [2018-11-10 07:45:03,295 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:45:03,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:45:03,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:45:03,295 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:45:03,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:58" (3/4) ... [2018-11-10 07:45:03,298 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:45:03,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:45:03,299 INFO L168 Benchmark]: Toolchain (without parser) took 5041.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -256.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:45:03,300 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:45:03,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:45:03,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:45:03,301 INFO L168 Benchmark]: Boogie Preprocessor took 19.11 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-11-10 07:45:03,301 INFO L168 Benchmark]: RCFGBuilder took 230.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:45:03,302 INFO L168 Benchmark]: BuchiAutomizer took 4409.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:45:03,302 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:45:03,305 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 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 80.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.11 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. * RCFGBuilder took 230.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4409.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 - 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 7 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[d] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 41 SDtfs, 51 SDslu, 38 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf99 lsp91 ukn105 mio100 lsp52 div159 bol100 ite100 ukn100 eq178 hnf71 smp92 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...