./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcat_diffterm_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_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/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 6a26bec8435101bdbb43abb11ad0cdd911d4601c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:30:42,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:30:42,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:30:42,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:30:42,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:30:42,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:30:42,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:30:42,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:30:42,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:30:42,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:30:42,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:30:42,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:30:42,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:30:42,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:30:42,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:30:42,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:30:42,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:30:42,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:30:42,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:30:42,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:30:42,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:30:42,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:30:42,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:30:42,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:30:42,375 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:30:42,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:30:42,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:30:42,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:30:42,377 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:30:42,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:30:42,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:30:42,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:30:42,379 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:30:42,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:30:42,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:30:42,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:30:42,380 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 13:30:42,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:30:42,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:30:42,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:30:42,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:30:42,391 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 13:30:42,391 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 13:30:42,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 13:30:42,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 13:30:42,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 13:30:42,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:30:42,393 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 13:30:42,394 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 13:30:42,394 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_63653b31-e312-488a-9f1d-d158bc04fe6c/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 -> 6a26bec8435101bdbb43abb11ad0cdd911d4601c [2018-11-10 13:30:42,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:30:42,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:30:42,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:30:42,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:30:42,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:30:42,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i [2018-11-10 13:30:42,462 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/data/c45ca78ab/e48519e58ea1463babc95a6ea43bd4d7/FLAG851808097 [2018-11-10 13:30:42,898 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:30:42,898 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/sv-benchmarks/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i [2018-11-10 13:30:42,906 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/data/c45ca78ab/e48519e58ea1463babc95a6ea43bd4d7/FLAG851808097 [2018-11-10 13:30:42,915 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/bin-2019/uautomizer/data/c45ca78ab/e48519e58ea1463babc95a6ea43bd4d7 [2018-11-10 13:30:42,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:30:42,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:30:42,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:42,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:30:42,922 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:30:42,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:42" (1/1) ... [2018-11-10 13:30:42,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a75b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:42, skipping insertion in model container [2018-11-10 13:30:42,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:42" (1/1) ... [2018-11-10 13:30:42,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:30:42,954 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:30:43,139 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:43,146 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:30:43,176 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:43,214 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:30:43,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43 WrapperNode [2018-11-10 13:30:43,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:43,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:43,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:30:43,215 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:30:43,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:43,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:30:43,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:30:43,281 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:30:43,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... [2018-11-10 13:30:43,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:30:43,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:30:43,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:30:43,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:30:43,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63653b31-e312-488a-9f1d-d158bc04fe6c/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 13:30:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 13:30:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 13:30:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:30:43,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:30:43,510 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:30:43,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:43 BoogieIcfgContainer [2018-11-10 13:30:43,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:30:43,511 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 13:30:43,511 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 13:30:43,515 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 13:30:43,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:30:43,516 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:30:42" (1/3) ... [2018-11-10 13:30:43,516 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51e3b855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:30:43, skipping insertion in model container [2018-11-10 13:30:43,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:30:43,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:43" (2/3) ... [2018-11-10 13:30:43,517 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51e3b855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:30:43, skipping insertion in model container [2018-11-10 13:30:43,517 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 13:30:43,517 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:43" (3/3) ... [2018-11-10 13:30:43,519 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_diffterm_alloca_true-termination.c.i [2018-11-10 13:30:43,567 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:30:43,568 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 13:30:43,568 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 13:30:43,568 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 13:30:43,568 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:30:43,568 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:30:43,568 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 13:30:43,569 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:30:43,569 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 13:30:43,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 13:30:43,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 13:30:43,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:30:43,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:30:43,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:43,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:30:43,605 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 13:30:43,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 13:30:43,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 13:30:43,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:30:43,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:30:43,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:43,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 13:30:43,612 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 4#L377true assume !(main_~length1~0 < 1); 8#L377-2true assume !(main_~length2~0 < 2); 20#L380-1true assume !(main_~length3~0 < 1); 13#L383-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 23#L389true SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L389 3#L389-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L389-1 19#L390true assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 10#L367-4true [2018-11-10 13:30:43,613 INFO L795 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 5#L367-1true SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 7#L367-2true assume !!(cstrcat_#t~mem205 != 49);havoc cstrcat_#t~mem205;cstrcat_#t~post206.base, cstrcat_#t~post206.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post206.base, cstrcat_#t~post206.offset + 1;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset; 10#L367-4true [2018-11-10 13:30:43,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 13:30:43,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:43,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 13:30:43,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:43,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 13:30:43,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:44,055 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-10 13:30:44,151 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:30:44,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:30:44,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:30:44,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:30:44,152 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:30:44,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:30:44,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:30:44,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:30:44,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 13:30:44,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:30:44,153 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:30:44,172 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 13:30:44,182 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 13:30:44,190 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 13:30:44,192 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 13:30:44,193 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 13:30:44,427 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-11-10 13:30:44,470 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 13:30:44,472 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 13:30:44,473 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 13:30:44,474 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 13:30:44,475 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 13:30:44,476 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 13:30:44,477 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 13:30:44,478 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 13:30:44,479 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 13:30:44,481 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 13:30:44,482 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 13:30:44,483 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 13:30:44,484 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 13:30:44,485 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 13:30:44,840 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:30:44,844 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:30:44,846 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 13:30:44,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:44,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:44,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:44,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,852 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 13:30:44,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:44,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:44,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,857 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 13:30:44,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:44,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:44,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:44,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,860 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 13:30:44,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:44,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:44,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:44,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,865 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 13:30:44,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:44,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:44,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,874 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 13:30:44,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:44,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:44,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:44,881 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 13:30:44,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:44,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:44,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:44,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:44,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:44,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:44,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:30:44,954 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:30:44,954 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 13:30:44,956 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:30:44,958 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:30:44,959 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:30:44,959 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 13:30:44,996 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 13:30:45,000 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:30:45,001 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 13:30:45,002 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 13:30:45,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:45,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:30:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:45,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:30:45,083 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 13:30:45,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 13:30:45,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 5 states. [2018-11-10 13:30:45,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 5 states. Result 54 states and 65 transitions. Complement of second has 8 states. [2018-11-10 13:30:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:30:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 13:30:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-10 13:30:45,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 13:30:45,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:45,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 13:30:45,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:45,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 13:30:45,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:45,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-10 13:30:45,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 13:30:45,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-11-10 13:30:45,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 13:30:45,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 13:30:45,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 13:30:45,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:30:45,169 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 13:30:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 13:30:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-10 13:30:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 13:30:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-10 13:30:45,192 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 13:30:45,193 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 13:30:45,193 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 13:30:45,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-10 13:30:45,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 13:30:45,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 13:30:45,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 13:30:45,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:45,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 13:30:45,194 INFO L793 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet210, main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 185#L377 assume !(main_~length1~0 < 1); 186#L377-2 assume !(main_~length2~0 < 2); 192#L380-1 assume !(main_~length3~0 < 1); 196#L383-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 197#L389 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L389 183#L389-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L389-1 184#L390 assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 194#L367-4 assume true; 189#L367-1 SUMMARY for call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L367-1 190#L367-2 assume !(cstrcat_#t~mem205 != 49);havoc cstrcat_#t~mem205; 188#L369-5 [2018-11-10 13:30:45,194 INFO L795 eck$LassoCheckResult]: Loop: 188#L369-5 assume true; 193#L369 cstrcat_#t~post207.base, cstrcat_#t~post207.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post207.base, cstrcat_#t~post207.offset + 1;cstrcat_#t~post208.base, cstrcat_#t~post208.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post208.base, cstrcat_#t~post208.offset + 1; 199#L369-1 SUMMARY for call cstrcat_#t~mem209 := read~int(cstrcat_#t~post208.base, cstrcat_#t~post208.offset, 1); srcloc: L369-1 200#L369-2 SUMMARY for call write~int(cstrcat_#t~mem209, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, 1); srcloc: L369-2 187#L369-3 assume !!(cstrcat_#t~mem209 != 49);havoc cstrcat_#t~post208.base, cstrcat_#t~post208.offset;havoc cstrcat_#t~mem209;havoc cstrcat_#t~post207.base, cstrcat_#t~post207.offset; 188#L369-5 [2018-11-10 13:30:45,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-11-10 13:30:45,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:45,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:45,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-11-10 13:30:45,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:45,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-11-10 13:30:45,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:30:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:30:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:30:45,491 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2018-11-10 13:30:45,564 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 13:30:45,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 13:30:45,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 13:30:45,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 13:30:45,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 13:30:45,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 13:30:45,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 13:30:45,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 13:30:45,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 13:30:45,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 13:30:45,565 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 13:30:45,569 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 13:30:45,575 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 13:30:45,577 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 13:30:45,578 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 13:30:45,580 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 13:30:45,583 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 13:30:45,588 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 13:30:45,589 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 13:30:45,591 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 13:30:45,593 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 13:30:45,595 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 13:30:45,597 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 13:30:45,600 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 13:30:45,603 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 13:30:45,605 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 13:30:45,606 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 13:30:45,843 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 13:30:45,946 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 13:30:45,948 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 13:30:45,949 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 13:30:46,344 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 13:30:46,345 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 13:30:46,345 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 13:30:46,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,348 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 13:30:46,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,350 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 13:30:46,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,352 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 13:30:46,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,356 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 13:30:46,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,359 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 13:30:46,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,362 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 13:30:46,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,366 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 13:30:46,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,388 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 13:30:46,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,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-10 13:30:46,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 13:30:46,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 13:30:46,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 13:30:46,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,396 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 13:30:46,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,399 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 13:30:46,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,404 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 13:30:46,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,409 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 13:30:46,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,415 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 13:30:46,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,420 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 13:30:46,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,429 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 13:30:46,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 13:30:46,438 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 13:30:46,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 13:30:46,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 13:30:46,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 13:30:46,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 13:30:46,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 13:30:46,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 13:30:46,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 13:30:46,498 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 13:30:46,499 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 13:30:46,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 13:30:46,499 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 13:30:46,500 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 13:30:46,500 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 13:30:46,573 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 13:30:46,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:30:46,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 13:30:46,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 13:30:46,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:46,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:30:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:46,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:30:46,658 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 13:30:46,658 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 13:30:46,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 13:30:46,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 24 states and 29 transitions. Complement of second has 8 states. [2018-11-10 13:30:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 13:30:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 13:30:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 13:30:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 13:30:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 13:30:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 13:30:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 13:30:46,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-10 13:30:46,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:30:46,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 13:30:46,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 13:30:46,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 13:30:46,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 13:30:46,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 13:30:46,722 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:46,722 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:46,722 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:30:46,722 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 13:30:46,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:30:46,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 13:30:46,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 13:30:46,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:30:46 BoogieIcfgContainer [2018-11-10 13:30:46,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 13:30:46,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:30:46,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:30:46,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:30:46,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:43" (3/4) ... [2018-11-10 13:30:46,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:30:46,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:30:46,730 INFO L168 Benchmark]: Toolchain (without parser) took 3812.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 952.2 MB in the beginning and 1.3 GB in the end (delta: -303.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:46,731 INFO L168 Benchmark]: CDTParser took 0.11 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-10 13:30:46,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.52 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 925.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:46,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:46,731 INFO L168 Benchmark]: Boogie Preprocessor took 17.16 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 13:30:46,732 INFO L168 Benchmark]: RCFGBuilder took 212.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:46,732 INFO L168 Benchmark]: BuchiAutomizer took 3215.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -136.2 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:30:46,732 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:30:46,734 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.11 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 295.52 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 925.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.16 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 212.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3215.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -136.2 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * 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 unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 54 SDslu, 46 SDs, 0 SdLazy, 28 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax100 hnf99 lsp97 ukn99 mio100 lsp44 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 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...