./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/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 77cd6aa75e9c7e5f4880befb873abc23862925a6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:30,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:30,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:30,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:30,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:30,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:30,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:30,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:30,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:30,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:30,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:30,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:30,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:30,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:30,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:30,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:30,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:30,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:30,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:30,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:30,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:30,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:30,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:30,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:30,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:30,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:30,151 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:30,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:30,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:30,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:30,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:30,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:30,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:30,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:30,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:30,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:30,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:30,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:30,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:30,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:30,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:30,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:30,172 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:30,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:30,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:30,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:30,174 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:30,174 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:30,174 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:30,174 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:30,174 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:30,175 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:30,175 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:30,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:30,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:30,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:30,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:30,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:30,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:30,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:30,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:30,177 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:30,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:30,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:30,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:30,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:30,178 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:30,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:30,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:30,179 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:30,179 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:30,180 INFO L138 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_d12affce-6012-4ab6-87a8-29531092d68b/bin/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 -> 77cd6aa75e9c7e5f4880befb873abc23862925a6 [2019-10-22 09:00:30,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:30,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:30,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:30,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:30,221 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:30,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2019-10-22 09:00:30,272 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/data/e24161cfc/13876c3f19c4408abafee41cd14b7e3d/FLAG226fd1041 [2019-10-22 09:00:30,723 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:30,724 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/sv-benchmarks/c/termination-memory-alloca/cstrncpy-alloca-1.i [2019-10-22 09:00:30,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/data/e24161cfc/13876c3f19c4408abafee41cd14b7e3d/FLAG226fd1041 [2019-10-22 09:00:31,247 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/uautomizer/data/e24161cfc/13876c3f19c4408abafee41cd14b7e3d [2019-10-22 09:00:31,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:31,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:31,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:31,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:31,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:31,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31, skipping insertion in model container [2019-10-22 09:00:31,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,270 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:31,322 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:31,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:31,698 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:31,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:31,798 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:31,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31 WrapperNode [2019-10-22 09:00:31,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:31,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:31,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:31,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:31,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:31,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:31,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... [2019-10-22 09:00:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:31,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:31,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:31,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:31,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d12affce-6012-4ab6-87a8-29531092d68b/bin/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 [2019-10-22 09:00:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:31,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:32,366 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:32,367 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:00:32,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32 BoogieIcfgContainer [2019-10-22 09:00:32,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:32,369 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:32,369 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:32,374 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:32,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:31" (1/3) ... [2019-10-22 09:00:32,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b444e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:32, skipping insertion in model container [2019-10-22 09:00:32,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:31" (2/3) ... [2019-10-22 09:00:32,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b444e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:32, skipping insertion in model container [2019-10-22 09:00:32,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:32,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32" (3/3) ... [2019-10-22 09:00:32,380 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-1.i [2019-10-22 09:00:32,435 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:32,435 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:32,435 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:32,435 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:32,436 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:32,436 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:32,436 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:32,436 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:32,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:00:32,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:32,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,484 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:32,484 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:32,484 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:32,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:00:32,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:32,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:32,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:32,492 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 16#L571-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 12#L553-2true [2019-10-22 09:00:32,493 INFO L793 eck$LassoCheckResult]: Loop: 12#L553-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 7#L555true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 12#L553-2true [2019-10-22 09:00:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 09:00:32,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335065403] [2019-10-22 09:00:32,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-10-22 09:00:32,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849933903] [2019-10-22 09:00:32,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-10-22 09:00:32,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393062553] [2019-10-22 09:00:32,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,911 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-22 09:00:33,446 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-10-22 09:00:33,562 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-22 09:00:33,573 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:33,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:33,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:33,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:33,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:33,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:33,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:33,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:33,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration1_Lasso [2019-10-22 09:00:33,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:33,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,985 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-10-22 09:00:34,138 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-22 09:00:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:34,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,067 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 09:00:35,122 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:35,126 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:35,128 INFO L120 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 [2019-10-22 09:00:35,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,132 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,136 INFO L120 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 [2019-10-22 09:00:35,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,138 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,138 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,139 INFO L120 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 [2019-10-22 09:00:35,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,140 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,141 INFO L120 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 [2019-10-22 09:00:35,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,144 INFO L120 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 [2019-10-22 09:00:35,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,147 INFO L120 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 [2019-10-22 09:00:35,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,150 INFO L120 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 [2019-10-22 09:00:35,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,153 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,153 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,156 INFO L120 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 [2019-10-22 09:00:35,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,158 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,159 INFO L120 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 [2019-10-22 09:00:35,160 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,162 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,167 INFO L120 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 [2019-10-22 09:00:35,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,170 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,184 INFO L120 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 [2019-10-22 09:00:35,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,185 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,185 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,188 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,199 INFO L120 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 [2019-10-22 09:00:35,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:35,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:35,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:35,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,202 INFO L120 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 [2019-10-22 09:00:35,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,204 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:35,207 INFO L120 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 [2019-10-22 09:00:35,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:35,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:35,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:35,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:35,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:35,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:35,302 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:35,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:35,392 INFO L444 ModelExtractionUtils]: 52 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:35,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:35,399 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:35,399 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:35,400 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-10-22 09:00:35,440 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-10-22 09:00:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:35,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:35,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:35,552 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 [2019-10-22 09:00:35,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-10-22 09:00:35,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-10-22 09:00:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-10-22 09:00:35,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 09:00:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:35,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:00:35,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:35,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 09:00:35,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:35,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-10-22 09:00:35,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 09:00:35,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:00:35,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 09:00:35,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:35,620 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 09:00:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 09:00:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 09:00:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 09:00:35,644 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 09:00:35,644 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 09:00:35,644 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:35,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 09:00:35,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:35,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:35,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:35,645 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:35,645 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:35,645 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 141#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 142#L568 assume !(main_~length~0 < 1); 144#L568-2 assume !(main_~n~0 < 1); 150#L571-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 147#L553-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 148#L555 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 146#L558-3 [2019-10-22 09:00:35,646 INFO L793 eck$LassoCheckResult]: Loop: 146#L558-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 145#L558-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 146#L558-3 [2019-10-22 09:00:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-10-22 09:00:35,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915576761] [2019-10-22 09:00:35,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-10-22 09:00:35,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446364543] [2019-10-22 09:00:35,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,714 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-10-22 09:00:35,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:35,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202730236] [2019-10-22 09:00:35,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:35,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:35,745 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,292 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-10-22 09:00:36,423 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-22 09:00:36,425 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:36,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:36,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:36,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:36,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:36,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:36,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:36,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:36,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-1.i_Iteration2_Lasso [2019-10-22 09:00:36,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:36,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:36,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:36,721 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-22 09:00:37,545 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 09:00:37,568 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,568 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:37,569 INFO L120 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 [2019-10-22 09:00:37,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,571 INFO L120 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 [2019-10-22 09:00:37,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,572 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,572 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,573 INFO L120 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 [2019-10-22 09:00:37,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,575 INFO L120 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 [2019-10-22 09:00:37,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,576 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,578 INFO L120 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 [2019-10-22 09:00:37,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,580 INFO L120 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 [2019-10-22 09:00:37,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,581 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,581 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,583 INFO L120 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 [2019-10-22 09:00:37,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,584 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,584 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,585 INFO L120 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 [2019-10-22 09:00:37,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,587 INFO L120 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 [2019-10-22 09:00:37,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,588 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,589 INFO L120 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 [2019-10-22 09:00:37,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,590 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,595 INFO L120 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 [2019-10-22 09:00:37,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,595 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,596 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,596 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,597 INFO L120 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 [2019-10-22 09:00:37,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,602 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,603 INFO L120 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 [2019-10-22 09:00:37,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,603 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,604 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,604 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,604 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,605 INFO L120 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 [2019-10-22 09:00:37,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,608 INFO L120 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 [2019-10-22 09:00:37,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,608 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,609 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,610 INFO L120 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 [2019-10-22 09:00:37,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,611 INFO L120 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 [2019-10-22 09:00:37,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,612 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,613 INFO L120 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 [2019-10-22 09:00:37,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,619 INFO L120 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 [2019-10-22 09:00:37,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,624 INFO L120 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 [2019-10-22 09:00:37,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,627 INFO L120 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 [2019-10-22 09:00:37,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,629 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,629 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,632 INFO L120 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 [2019-10-22 09:00:37,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,635 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,645 INFO L120 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 [2019-10-22 09:00:37,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,652 INFO L120 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 [2019-10-22 09:00:37,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,663 INFO L120 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 [2019-10-22 09:00:37,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,667 INFO L120 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 [2019-10-22 09:00:37,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,668 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,668 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,669 INFO L120 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 [2019-10-22 09:00:37,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,673 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:37,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,694 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 09:00:37,694 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:00:37,922 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:38,142 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-10-22 09:00:38,142 INFO L444 ModelExtractionUtils]: 67 out of 81 variables were initially zero. Simplification set additionally 11 variables to zero. [2019-10-22 09:00:38,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:38,144 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 09:00:38,145 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:38,145 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2019-10-22 09:00:38,181 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 09:00:38,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:00:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:38,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:00:38,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:38,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 09:00:38,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 09:00:38,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-10-22 09:00:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:00:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:00:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 09:00:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:00:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:00:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:38,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-10-22 09:00:38,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:38,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 09:00:38,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:38,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:38,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:38,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:38,314 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,315 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,315 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:38,315 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:38,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:38,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:38,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:38,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:38 BoogieIcfgContainer [2019-10-22 09:00:38,329 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:38,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:38,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:38,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:38,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:32" (3/4) ... [2019-10-22 09:00:38,333 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:38,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:38,336 INFO L168 Benchmark]: Toolchain (without parser) took 7083.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 939.1 MB in the beginning and 901.0 MB in the end (delta: 38.1 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,336 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:38,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.25 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. [2019-10-22 09:00:38,337 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,338 INFO L168 Benchmark]: RCFGBuilder took 477.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,339 INFO L168 Benchmark]: BuchiAutomizer took 5960.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 901.0 MB in the end (delta: 184.8 MB). Peak memory consumption was 236.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:38,340 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 901.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:38,342 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.61 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 477.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5960.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.1 GB in the beginning and 901.0 MB in the end (delta: 184.8 MB). Peak memory consumption was 236.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.2 GB. Free memory is still 901.0 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 (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax107 hnf99 lsp90 ukn85 mio100 lsp49 div100 bol100 ite100 ukn100 eq203 hnf85 smp100 dnf173 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 476ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...