./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_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_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/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 0e48acfd964328d443bb00db1a9e4c58c0207581 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:57:45,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:57:45,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:57:45,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:57:45,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:57:45,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:57:45,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:57:45,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:57:45,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:57:45,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:57:45,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:57:45,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:57:45,164 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:57:45,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:57:45,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:57:45,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:57:45,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:57:45,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:57:45,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:57:45,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:57:45,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:57:45,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:57:45,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:57:45,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:57:45,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:57:45,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:57:45,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:57:45,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:57:45,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:57:45,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:57:45,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:57:45,175 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:57:45,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:57:45,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:57:45,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:57:45,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:57:45,177 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 00:57:45,184 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:57:45,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:57:45,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:57:45,186 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:57:45,186 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:57:45,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:57:45,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:57:45,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:57:45,188 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:57:45,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:57:45,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:57:45,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:57:45,188 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:57:45,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:57:45,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:57:45,189 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:57:45,189 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:57:45,189 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_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/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 -> 0e48acfd964328d443bb00db1a9e4c58c0207581 [2018-11-10 00:57:45,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:57:45,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:57:45,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:57:45,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:57:45,225 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:57:45,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-10 00:57:45,271 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/data/19701bf65/42f1a14384ec4b7f83e093f10f395d2a/FLAG5c16e65cc [2018-11-10 00:57:45,623 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:57:45,623 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca_true-termination.c.i [2018-11-10 00:57:45,631 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/data/19701bf65/42f1a14384ec4b7f83e093f10f395d2a/FLAG5c16e65cc [2018-11-10 00:57:45,640 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/bin-2019/uautomizer/data/19701bf65/42f1a14384ec4b7f83e093f10f395d2a [2018-11-10 00:57:45,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:57:45,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:57:45,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:57:45,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:57:45,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:57:45,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:45,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af148b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45, skipping insertion in model container [2018-11-10 00:57:45,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:45,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:57:45,678 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:57:45,869 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:57:45,875 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:57:45,904 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:57:45,934 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:57:45,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45 WrapperNode [2018-11-10 00:57:45,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:57:45,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:57:45,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:57:45,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:57:45,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:57:46,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:57:46,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:57:46,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:57:46,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... [2018-11-10 00:57:46,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:57:46,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:57:46,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:57:46,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:57:46,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dea2eb-68b7-47d1-8680-4addd2a4f6c5/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 00:57:46,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:57:46,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:57:46,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:57:46,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:57:46,282 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:57:46,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:57:46 BoogieIcfgContainer [2018-11-10 00:57:46,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:57:46,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:57:46,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:57:46,285 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:57:46,285 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:57:46,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:57:45" (1/3) ... [2018-11-10 00:57:46,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:57:46, skipping insertion in model container [2018-11-10 00:57:46,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:57:46,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:57:45" (2/3) ... [2018-11-10 00:57:46,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:57:46, skipping insertion in model container [2018-11-10 00:57:46,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:57:46,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:57:46" (3/3) ... [2018-11-10 00:57:46,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca_true-termination.c.i [2018-11-10 00:57:46,329 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:57:46,329 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:57:46,330 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:57:46,330 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:57:46,330 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:57:46,330 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:57:46,330 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:57:46,330 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:57:46,330 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:57:46,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 00:57:46,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:57:46,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:57:46,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:57:46,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:57:46,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 00:57:46,364 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:57:46,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 00:57:46,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 00:57:46,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:57:46,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:57:46,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:57:46,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 00:57:46,373 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 28#L381true assume !(main_~length1~0 < 1); 29#L381-2true assume !(main_~length2~0 < 1); 24#L384-1true assume !(main_~n~0 < 1); 7#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.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~malloc217.base, main_#t~malloc217.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~malloc217.base, main_#t~malloc217.offset; 15#L393true SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L393 16#L393-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L393-1 12#L394true assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 10#L367-4true [2018-11-10 00:57:46,373 INFO L795 eck$LassoCheckResult]: Loop: 10#L367-4true assume true; 3#L367-1true SUMMARY for call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L367-1 5#L367-2true assume !!(cstrncat_#t~mem205 != 49);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, cstrncat_#t~post206.offset + 1;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 10#L367-4true [2018-11-10 00:57:46,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 00:57:46,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:57:46,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:57:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:57:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 00:57:46,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:57:46,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:57:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:57:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 00:57:46,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:57:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:57:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:57:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:57:46,842 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2018-11-10 00:57:46,951 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-10 00:57:46,964 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:57:46,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:57:46,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:57:46,965 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:57:46,965 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:57:46,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:57:46,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:57:46,966 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:57:46,966 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 00:57:46,966 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:57:46,966 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:57:46,989 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 00:57:46,994 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 00:57:47,011 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 00:57:47,014 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 00:57:47,251 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-11-10 00:57:47,295 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 00:57:47,296 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 00:57:47,297 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 00:57:47,298 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 00:57:47,299 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 00:57:47,300 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 00:57:47,302 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 00:57:47,303 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 00:57:47,304 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 00:57:47,306 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 00:57:47,307 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 00:57:47,326 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 00:57:47,328 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 00:57:47,330 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 00:57:47,331 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 00:57:47,332 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 00:57:47,333 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 00:57:47,334 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 00:57:47,668 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:57:47,672 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:57:47,673 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 00:57:47,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:57:47,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:57:47,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:57:47,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,678 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 00:57:47,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,684 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 00:57:47,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:57:47,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:57:47,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:57:47,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,686 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 00:57:47,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,692 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 00:57:47,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,698 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 00:57:47,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,699 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:57:47,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,702 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:57:47,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,721 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 00:57:47,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,726 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 00:57:47,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,732 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 00:57:47,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:57:47,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,734 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:57:47,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,745 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 00:57:47,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:57:47,762 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 00:57:47,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:57:47,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:57:47,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:57:47,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:57:47,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:57:47,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:57:47,805 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:57:47,818 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:57:47,818 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:57:47,820 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:57:47,821 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:57:47,821 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:57:47,822 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2018-11-10 00:57:47,861 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 00:57:47,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 00:57:47,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:47,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:57:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:47,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:57:47,937 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 00:57:47,947 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 00:57:47,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 5 states. [2018-11-10 00:57:48,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 5 states. Result 76 states and 98 transitions. Complement of second has 9 states. [2018-11-10 00:57:48,026 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 00:57:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 00:57:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-10 00:57:48,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 00:57:48,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:57:48,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 00:57:48,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:57:48,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 00:57:48,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:57:48,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 98 transitions. [2018-11-10 00:57:48,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:57:48,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 32 states and 39 transitions. [2018-11-10 00:57:48,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 00:57:48,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 00:57:48,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-10 00:57:48,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 00:57:48,038 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 00:57:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-10 00:57:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-10 00:57:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 00:57:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-10 00:57:48,054 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 00:57:48,054 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 00:57:48,055 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:57:48,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-10 00:57:48,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 00:57:48,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:57:48,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:57:48,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:57:48,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 00:57:48,056 INFO L793 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 228#L381 assume !(main_~length1~0 < 1); 233#L381-2 assume !(main_~length2~0 < 1); 226#L384-1 assume !(main_~n~0 < 1); 218#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.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~malloc217.base, main_#t~malloc217.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~malloc217.base, main_#t~malloc217.offset; 219#L393 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L393 229#L393-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L393-1 225#L394 assume { :begin_inline_cstrncat } true;cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 224#L367-4 assume true; 213#L367-1 SUMMARY for call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L367-1 214#L367-2 assume !(cstrncat_#t~mem205 != 49);havoc cstrncat_#t~mem205; 215#L369-8 assume true; 231#L369 cstrncat_#t~short209 := cstrncat_~n != 0; 235#L369-1 assume !cstrncat_#t~short209; 217#L369-6 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset + 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 237#L369-8 assume true; 230#L369 [2018-11-10 00:57:48,056 INFO L795 eck$LassoCheckResult]: Loop: 230#L369 cstrncat_#t~short209 := cstrncat_~n != 0; 234#L369-1 assume !cstrncat_#t~short209; 220#L369-6 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset + 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 221#L369-8 assume true; 230#L369 [2018-11-10 00:57:48,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1206762798, now seen corresponding path program 1 times [2018-11-10 00:57:48,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:57:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:57:48,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:48,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:57:48,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:57:48,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:57:48,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:57:48,105 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 00:57:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:57:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2378489, now seen corresponding path program 1 times [2018-11-10 00:57:48,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:57:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:57:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:48,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:57:48,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:57:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:57:48,115 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 00:57:48,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:57:48,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:57:48,116 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:57:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:57:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:57:48,119 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 00:57:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:57:48,144 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-10 00:57:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:57:48,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-10 00:57:48,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:57:48,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:57:48,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:57:48,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:57:48,146 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:57:48,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:57:48,146 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:57:48,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:57:48,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:57:48 BoogieIcfgContainer [2018-11-10 00:57:48,150 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:57:48,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:57:48,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:57:48,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:57:48,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:57:46" (3/4) ... [2018-11-10 00:57:48,153 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:57:48,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:57:48,154 INFO L168 Benchmark]: Toolchain (without parser) took 2511.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 957.6 MB in the beginning and 993.9 MB in the end (delta: -36.3 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,155 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:57:48,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 929.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,156 INFO L168 Benchmark]: Boogie Preprocessor took 20.43 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,156 INFO L168 Benchmark]: RCFGBuilder took 235.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,157 INFO L168 Benchmark]: BuchiAutomizer took 1867.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:57:48,157 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:57:48,160 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 929.7 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -210.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.43 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1867.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.9 MB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 993.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * s and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 48 SDtfs, 54 SDslu, 45 SDs, 0 SdLazy, 26 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital206 mio100 ax100 hnf98 lsp97 ukn92 mio100 lsp42 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...