./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/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 32bit --witnessprinter.graph.data.programhash 8e5b411c800020cce3512b5f08fad6ae7c3970bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:50:48,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:50:48,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:50:48,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:50:48,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:50:48,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:50:48,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:50:48,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:50:48,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:50:48,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:50:48,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:50:48,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:50:48,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:50:48,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:50:48,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:50:48,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:50:48,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:50:48,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:50:48,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:50:48,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:50:48,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:50:48,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:50:48,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:50:48,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:50:48,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:50:48,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:50:48,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:50:48,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:50:48,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:50:48,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:50:48,379 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:50:48,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:50:48,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:50:48,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:50:48,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:50:48,381 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:50:48,381 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:50:48,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:50:48,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:50:48,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:50:48,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:50:48,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:50:48,391 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:50:48,392 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:50:48,392 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:50:48,392 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:50:48,392 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:50:48,392 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:50:48,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:50:48,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:50:48,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:50:48,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:50:48,395 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:50:48,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:50:48,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:50:48,395 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:50:48,396 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:50:48,396 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_66898b88-f9b4-410b-bbb4-51ff7bce7788/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e5b411c800020cce3512b5f08fad6ae7c3970bd [2018-11-10 11:50:48,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:50:48,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:50:48,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:50:48,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:50:48,436 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:50:48,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:48,480 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/data/0af3d97a5/72fc33d2027441ae96dba36eb7ae3953/FLAGbde012b8b [2018-11-10 11:50:48,848 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:50:48,848 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/sv-benchmarks/c/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:48,855 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/data/0af3d97a5/72fc33d2027441ae96dba36eb7ae3953/FLAGbde012b8b [2018-11-10 11:50:48,868 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/bin-2019/uautomizer/data/0af3d97a5/72fc33d2027441ae96dba36eb7ae3953 [2018-11-10 11:50:48,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:50:48,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:50:48,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:48,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:50:48,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:50:48,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:48" (1/1) ... [2018-11-10 11:50:48,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df4f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:48, skipping insertion in model container [2018-11-10 11:50:48,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:48" (1/1) ... [2018-11-10 11:50:48,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:50:48,916 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:50:49,116 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:49,124 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:50:49,153 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:49,187 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:50:49,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49 WrapperNode [2018-11-10 11:50:49,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:49,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:49,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:50:49,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:50:49,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:49,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:50:49,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:50:49,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:50:49,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... [2018-11-10 11:50:49,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:50:49,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:50:49,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:50:49,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:50:49,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_66898b88-f9b4-410b-bbb4-51ff7bce7788/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 11:50:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:50:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:50:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:50:49,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:50:49,613 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:50:49,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:49 BoogieIcfgContainer [2018-11-10 11:50:49,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:50:49,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:50:49,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:50:49,617 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:50:49,619 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:49,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:50:48" (1/3) ... [2018-11-10 11:50:49,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e0b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:49, skipping insertion in model container [2018-11-10 11:50:49,620 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:49,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:49" (2/3) ... [2018-11-10 11:50:49,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e0b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:49, skipping insertion in model container [2018-11-10 11:50:49,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:49,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:49" (3/3) ... [2018-11-10 11:50:49,623 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:49,667 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:50:49,667 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:50:49,668 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:50:49,668 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:50:49,668 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:50:49,668 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:50:49,668 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:50:49,668 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:50:49,668 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:50:49,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 11:50:49,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 11:50:49,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:49,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:49,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:49,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:50:49,706 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:50:49,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-10 11:50:49,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 11:50:49,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:49,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:49,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:49,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:50:49,717 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 5#L557true assume !(main_~length1~0 < 1); 6#L557-2true assume !(main_~length2~0 < 1); 29#L560-1true assume !(main_~n~0 < 1); 12#L563-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 21#L569true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L569 22#L569-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L569-1 19#L570true 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~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, 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; 16#L543-4true [2018-11-10 11:50:49,717 INFO L795 eck$LassoCheckResult]: Loop: 16#L543-4true assume true; 8#L543-1true SUMMARY for call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L543-1 10#L543-2true assume !!(cstrncat_#t~mem2 != 0);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post3.base, cstrncat_#t~post3.offset + 1;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 16#L543-4true [2018-11-10 11:50:49,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 11:50:49,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:49,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 11:50:49,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:49,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 11:50:49,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:49,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:50,277 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2018-11-10 11:50:50,424 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 11:50:50,435 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:50:50,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:50:50,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:50:50,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:50:50,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:50:50,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:50,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:50:50,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:50:50,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 11:50:50,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:50:50,438 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:50:50,467 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 11:50:50,770 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2018-11-10 11:50:50,819 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 11:50:50,820 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 11:50:50,822 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 11:50:50,823 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 11:50:50,824 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 11:50:50,826 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 11:50:50,827 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 11:50:50,829 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 11:50:50,831 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 11:50:50,837 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 11:50:50,838 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 11:50:50,839 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 11:50:50,841 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 11:50:50,842 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 11:50:50,844 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 11:50:50,849 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 11:50:50,851 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 11:50:50,853 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 11:50:50,854 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 11:50:50,856 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 11:50:50,857 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 11:50:51,255 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:50:51,259 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:50:51,261 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 11:50:51,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,272 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 11:50:51,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,285 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 11:50:51,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,292 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 11:50:51,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,293 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:50:51,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,296 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:50:51,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,311 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 11:50:51,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,311 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:50:51,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,315 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:50:51,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,335 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 11:50:51,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,341 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 11:50:51,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,346 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 11:50:51,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:51,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:51,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:50:51,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,352 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:50:51,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:51,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,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 11:50:51,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:51,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:51,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:51,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:51,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:51,372 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 11:50:51,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:51,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:51,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:51,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:51,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:51,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:51,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:50:51,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:50:51,432 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:50:51,434 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:50:51,435 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:50:51,436 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:50:51,436 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2018-11-10 11:50:51,474 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 11:50:51,479 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:50:51,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:51,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:51,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:51,543 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 11:50:51,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:50:51,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2018-11-10 11:50:51,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 79 states and 101 transitions. Complement of second has 7 states. [2018-11-10 11:50:51,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:50:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:50:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-10 11:50:51,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 11:50:51,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:51,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 11:50:51,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:51,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 68 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 11:50:51,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:51,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 101 transitions. [2018-11-10 11:50:51,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:50:51,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 32 states and 39 transitions. [2018-11-10 11:50:51,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:50:51,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 11:50:51,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-10 11:50:51,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:50:51,626 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-10 11:50:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-10 11:50:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-10 11:50:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 11:50:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-10 11:50:51,647 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 11:50:51,647 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-10 11:50:51,647 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:50:51,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-10 11:50:51,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:50:51,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:51,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:51,648 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 11:50:51,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:50:51,649 INFO L793 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 212#L557 assume !(main_~length1~0 < 1); 213#L557-2 assume !(main_~length2~0 < 1); 216#L560-1 assume !(main_~n~0 < 1); 229#L563-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 209#L569 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1) * 1, 1); srcloc: L569 210#L569-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L569-1 211#L570 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~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post7, cstrncat_#t~post8.base, cstrncat_#t~post8.offset, cstrncat_#t~post4.base, cstrncat_#t~post4.offset, cstrncat_#t~mem5, cstrncat_#t~short6, cstrncat_#t~mem9, 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; 230#L543-4 assume true; 223#L543-1 SUMMARY for call cstrncat_#t~mem2 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); srcloc: L543-1 224#L543-2 assume !(cstrncat_#t~mem2 != 0);havoc cstrncat_#t~mem2; 226#L545-8 assume true; 233#L545 cstrncat_#t~short6 := cstrncat_~n != 0; 232#L545-1 assume !cstrncat_#t~short6; 228#L545-6 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, cstrncat_#t~post8.offset + 1;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 231#L545-8 assume true; 206#L545 [2018-11-10 11:50:51,649 INFO L795 eck$LassoCheckResult]: Loop: 206#L545 cstrncat_#t~short6 := cstrncat_~n != 0; 214#L545-1 assume !cstrncat_#t~short6; 217#L545-6 assume !!cstrncat_#t~short6;havoc cstrncat_#t~mem5;havoc cstrncat_#t~short6;havoc cstrncat_#t~post4.base, cstrncat_#t~post4.offset;cstrncat_#t~post7 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post7 - 1;havoc cstrncat_#t~post7;cstrncat_#t~post8.base, cstrncat_#t~post8.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post8.base, cstrncat_#t~post8.offset + 1;havoc cstrncat_#t~post8.base, cstrncat_#t~post8.offset; 205#L545-8 assume true; 206#L545 [2018-11-10 11:50:51,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1206762798, now seen corresponding path program 1 times [2018-11-10 11:50:51,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:51,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:51,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:51,697 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 11:50:51,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:51,701 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:50:51,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2378489, now seen corresponding path program 1 times [2018-11-10 11:50:51,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:51,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:51,709 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 11:50:51,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:50:51,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:50:51,709 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:50:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:50:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:50:51,713 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-10 11:50:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:51,724 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-10 11:50:51,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:50:51,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-10 11:50:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:51,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-10 11:50:51,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:50:51,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:50:51,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:50:51,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:51,726 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:51,726 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:51,726 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:51,726 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:50:51,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:50:51,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:51,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:50:51,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:50:51 BoogieIcfgContainer [2018-11-10 11:50:51,731 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:50:51,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:50:51,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:50:51,732 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:50:51,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:49" (3/4) ... [2018-11-10 11:50:51,734 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:50:51,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:50:51,735 INFO L168 Benchmark]: Toolchain (without parser) took 2864.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:51,736 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:51,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.71 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:51,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.1 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:51,737 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:51,738 INFO L168 Benchmark]: RCFGBuilder took 318.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:51,738 INFO L168 Benchmark]: BuchiAutomizer took 2117.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.4 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:51,738 INFO L168 Benchmark]: Witness Printer took 3.10 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 11:50:51,741 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.71 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.1 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2117.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.4 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. 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: 53 SDtfs, 38 SDslu, 38 SDs, 0 SdLazy, 20 SolverSat, 6 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: 18ms VariablesStem: 5 VariablesLoop: 0 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...