./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/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 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:36:09,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:36:09,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:36:09,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:36:09,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:36:09,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:36:09,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:36:09,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:36:09,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:36:09,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:36:09,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:36:09,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:36:09,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:36:09,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:36:09,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:36:09,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:36:09,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:36:09,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:36:09,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:36:09,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:36:09,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:36:09,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:36:09,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:36:09,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:36:09,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:36:09,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:36:09,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:36:09,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:36:09,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:36:09,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:36:09,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:36:09,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:36:09,838 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:36:09,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:36:09,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:36:09,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:36:09,840 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:36:09,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:36:09,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:36:09,851 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:36:09,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:36:09,851 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:36:09,852 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:36:09,852 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:36:09,852 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:36:09,852 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:36:09,852 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:36:09,852 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:36:09,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:36:09,853 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:36:09,854 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:36:09,854 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:36:09,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:36:09,854 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:36:09,854 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:36:09,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:36:09,856 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:36:09,856 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:36:09,857 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:36:09,857 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_4f89658f-d7e2-49af-b349-4da775bc4a90/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 -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2018-11-23 13:36:09,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:36:09,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:36:09,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:36:09,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:36:09,892 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:36:09,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-23 13:36:09,925 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/data/5deec8b3b/93aaed4428724593b537c441e47e5a9c/FLAG41be5599b [2018-11-23 13:36:10,364 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:36:10,364 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca_true-termination.c.i [2018-11-23 13:36:10,371 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/data/5deec8b3b/93aaed4428724593b537c441e47e5a9c/FLAG41be5599b [2018-11-23 13:36:10,380 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/bin-2019/uautomizer/data/5deec8b3b/93aaed4428724593b537c441e47e5a9c [2018-11-23 13:36:10,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:36:10,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:36:10,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:36:10,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:36:10,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:36:10,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10, skipping insertion in model container [2018-11-23 13:36:10,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:36:10,418 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:36:10,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:36:10,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:36:10,709 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:36:10,740 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:36:10,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10 WrapperNode [2018-11-23 13:36:10,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:36:10,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:36:10,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:36:10,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:36:10,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:36:10,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:36:10,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:36:10,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:36:10,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... [2018-11-23 13:36:10,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:36:10,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:36:10,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:36:10,783 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:36:10,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f89658f-d7e2-49af-b349-4da775bc4a90/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-23 13:36:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:36:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:36:10,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:36:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:36:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:36:10,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:36:11,021 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:36:11,022 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 13:36:11,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:11 BoogieIcfgContainer [2018-11-23 13:36:11,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:36:11,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:36:11,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:36:11,025 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:36:11,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:36:11,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:36:10" (1/3) ... [2018-11-23 13:36:11,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48a729a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:36:11, skipping insertion in model container [2018-11-23 13:36:11,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:36:11,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:36:10" (2/3) ... [2018-11-23 13:36:11,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48a729a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:36:11, skipping insertion in model container [2018-11-23 13:36:11,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:36:11,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:11" (3/3) ... [2018-11-23 13:36:11,028 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca_true-termination.c.i [2018-11-23 13:36:11,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:36:11,062 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:36:11,062 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:36:11,062 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:36:11,062 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:36:11,062 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:36:11,062 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:36:11,062 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:36:11,062 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:36:11,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 13:36:11,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:36:11,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:36:11,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:36:11,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:36:11,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:36:11,091 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:36:11,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 13:36:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:36:11,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:36:11,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:36:11,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:36:11,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:36:11,098 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 13#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 7#L367-5true [2018-11-23 13:36:11,098 INFO L796 eck$LassoCheckResult]: Loop: 7#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 3#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 5#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 7#L367-5true [2018-11-23 13:36:11,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 13:36:11,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:36:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:36:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:36:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2018-11-23 13:36:11,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:36:11,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:36:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:36:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2018-11-23 13:36:11,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:36:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:36:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:36:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:11,410 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2018-11-23 13:36:11,617 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 13:36:11,685 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:36:11,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:36:11,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:36:11,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:36:11,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:36:11,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:36:11,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:36:11,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:36:11,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 13:36:11,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:36:11,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:36:11,706 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-23 13:36:11,710 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-23 13:36:11,714 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-23 13:36:11,716 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-23 13:36:11,719 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-23 13:36:11,720 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-23 13:36:11,721 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-23 13:36:11,723 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-23 13:36:11,727 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-23 13:36:11,729 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-23 13:36:11,730 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-23 13:36:11,732 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-23 13:36:11,733 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-23 13:36:11,734 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-23 13:36:11,735 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-23 13:36:11,940 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2018-11-23 13:36:12,015 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-23 13:36:12,016 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-23 13:36:12,017 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-23 13:36:12,019 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-23 13:36:12,020 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-23 13:36:12,021 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-23 13:36:12,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:36:12,342 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:36:12,344 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-23 13:36:12,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,351 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-23 13:36:12,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,354 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-23 13:36:12,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,358 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-23 13:36:12,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,364 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-23 13:36:12,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,368 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-23 13:36:12,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,374 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-23 13:36:12,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,376 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-23 13:36:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,382 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-23 13:36:12,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,384 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-23 13:36:12,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,386 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-23 13:36:12,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,389 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-23 13:36:12,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,391 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-23 13:36:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,394 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-23 13:36:12,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:36:12,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,400 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-23 13:36:12,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,416 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-23 13:36:12,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:36:12,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:36:12,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,433 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-23 13:36:12,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,434 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:36:12,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,436 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:36:12,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,450 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-23 13:36:12,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,456 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-23 13:36:12,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:36:12,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,456 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:36:12,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:36:12,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:36:12,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,461 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-23 13:36:12,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,467 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-23 13:36:12,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,478 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-23 13:36:12,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:36:12,485 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-23 13:36:12,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:36:12,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:36:12,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:36:12,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:36:12,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:36:12,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:36:12,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:36:12,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:36:12,561 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:36:12,563 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:36:12,565 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:36:12,565 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:36:12,566 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2018-11-23 13:36:12,612 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 13:36:12,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:36:12,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:36:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:36:12,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:36:12,667 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-23 13:36:12,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:36:12,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2018-11-23 13:36:12,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2018-11-23 13:36:12,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:36:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:36:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-23 13:36:12,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-23 13:36:12,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:36:12,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-23 13:36:12,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:36:12,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-23 13:36:12,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:36:12,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2018-11-23 13:36:12,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:36:12,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2018-11-23 13:36:12,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 13:36:12,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:36:12,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-23 13:36:12,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:36:12,740 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:36:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-23 13:36:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 13:36:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:36:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-23 13:36:12,758 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 13:36:12,758 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-23 13:36:12,758 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:36:12,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-23 13:36:12,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:36:12,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:36:12,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:36:12,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:36:12,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:36:12,760 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 158#L378 assume !(main_~length1~0 < 1); 165#L378-2 assume !(main_~length2~0 < 1); 166#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 169#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2018-11-23 13:36:12,760 INFO L796 eck$LassoCheckResult]: Loop: 159#L367-1 assume !cstrcmp_#t~short208; 160#L367-3 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~short208;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 167#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2018-11-23 13:36:12,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2018-11-23 13:36:12,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:36:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:36:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:36:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:36:12,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:36:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2018-11-23 13:36:12,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:36:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:36:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:12,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:36:12,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:36:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:36:12,807 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-23 13:36:12,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:36:12,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:36:12,810 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:36:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:36:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:36:12,813 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:36:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:36:12,825 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-11-23 13:36:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:36:12,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2018-11-23 13:36:12,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:36:12,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:36:12,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:36:12,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:36:12,827 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:36:12,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:36:12,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:36:12,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:36:12,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:36:12 BoogieIcfgContainer [2018-11-23 13:36:12,833 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:36:12,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:36:12,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:36:12,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:36:12,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:36:11" (3/4) ... [2018-11-23 13:36:12,837 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:36:12,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:36:12,838 INFO L168 Benchmark]: Toolchain (without parser) took 2455.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:36:12,838 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:36:12,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:36:12,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.54 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-23 13:36:12,840 INFO L168 Benchmark]: Boogie Preprocessor took 15.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:36:12,840 INFO L168 Benchmark]: RCFGBuilder took 239.14 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:36:12,840 INFO L168 Benchmark]: BuchiAutomizer took 1810.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:36:12,841 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:36:12,843 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.54 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. * Boogie Preprocessor took 15.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 239.14 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1810.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.21 ms. Allocated memory is still 1.2 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s2 + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. 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 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 17 SDslu, 18 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf100 lsp97 ukn85 mio100 lsp50 div100 bol100 ite100 ukn100 eq188 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...