./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/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 32bit --witnessprinter.graph.data.programhash 836fc197f01e8142cd1fe75cc7c363600c112d62 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 08:59:13,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:13,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:13,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:13,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:13,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:13,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:13,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:13,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:13,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:13,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:13,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:13,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:13,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:13,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:13,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:13,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:13,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:13,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:13,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:13,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:13,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:13,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:13,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:13,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:13,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:13,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:13,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:13,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:13,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:13,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:13,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:13,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:13,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:13,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:13,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:13,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:13,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:13,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:13,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:13,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:13,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:13,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:13,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:13,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:13,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:13,300 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:13,300 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:13,300 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:13,301 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:13,301 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:13,301 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:13,301 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:13,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:13,301 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:13,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:13,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:13,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:13,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:13,303 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:13,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:13,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:13,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:13,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:13,304 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:13,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:13,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:13,305 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:13,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:13,306 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_9cc97472-4890-479c-8c5c-de703db0ec2e/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 836fc197f01e8142cd1fe75cc7c363600c112d62 [2019-10-22 08:59:13,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:13,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:13,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:13,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:13,355 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:13,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-10-22 08:59:13,408 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/data/6675b2069/617b59f3e890488297e680dfdbdcf044/FLAG91cbd26fb [2019-10-22 08:59:13,808 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:13,809 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-10-22 08:59:13,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/data/6675b2069/617b59f3e890488297e680dfdbdcf044/FLAG91cbd26fb [2019-10-22 08:59:14,179 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/bin/uautomizer/data/6675b2069/617b59f3e890488297e680dfdbdcf044 [2019-10-22 08:59:14,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:14,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:14,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:14,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:14,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:14,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68eada55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14, skipping insertion in model container [2019-10-22 08:59:14,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,199 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:14,233 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:14,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:14,640 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:14,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:14,717 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:14,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14 WrapperNode [2019-10-22 08:59:14,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:14,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:14,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:14,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:14,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:14,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:14,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:14,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:14,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... [2019-10-22 08:59:14,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:14,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:14,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:14,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:14,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9cc97472-4890-479c-8c5c-de703db0ec2e/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 08:59:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:14,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:14,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:14,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:14,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:15,144 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:15,144 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:59:15,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:15 BoogieIcfgContainer [2019-10-22 08:59:15,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:15,146 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:15,146 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:15,149 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:15,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:15,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:14" (1/3) ... [2019-10-22 08:59:15,162 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71b6dfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:15, skipping insertion in model container [2019-10-22 08:59:15,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:15,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:14" (2/3) ... [2019-10-22 08:59:15,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71b6dfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:15, skipping insertion in model container [2019-10-22 08:59:15,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:15,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:15" (3/3) ... [2019-10-22 08:59:15,165 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2019-10-22 08:59:15,216 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:15,216 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:15,216 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:15,217 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:15,217 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:15,217 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:15,217 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:15,217 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:15,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:15,253 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:59:15,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:15,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:15,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:15,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:15,259 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:15,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:15,261 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:59:15,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:15,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:15,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:15,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:15,267 INFO L791 eck$LassoCheckResult]: Stem: 11#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~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.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; 4#L535true assume !(main_~length~0 < 1); 6#L535-2true assume !(main_~n~0 < 1); 3#L538-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;main_~i~0 := 0; 12#L544-3true [2019-10-22 08:59:15,267 INFO L793 eck$LassoCheckResult]: Loop: 12#L544-3true assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 10#L544-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 12#L544-3true [2019-10-22 08:59:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:59:15,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:15,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736911043] [2019-10-22 08:59:15,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:59:15,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:15,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835181574] [2019-10-22 08:59:15,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,415 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:59:15,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:15,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557220668] [2019-10-22 08:59:15,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:15,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:15,457 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:15,657 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:15,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:15,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:15,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:15,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:15,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:15,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:15,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:15,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration1_Lasso [2019-10-22 08:59:15,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:15,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:15,684 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 08:59:15,690 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 08:59:15,692 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 08:59:15,695 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 08:59:15,849 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 08:59:15,853 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 08:59:15,856 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 08:59:15,860 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 08:59:15,868 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 08:59:15,870 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 08:59:15,873 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 08:59:15,877 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 08:59:15,880 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 08:59:16,230 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:16,291 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:16,297 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:16,298 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 08:59:16,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,301 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:16,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:16,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:16,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,305 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 08:59:16,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:16,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:16,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:16,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,309 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 08:59:16,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,309 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:16,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:16,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:16,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:16,312 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 08:59:16,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:16,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:16,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:16,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:16,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:16,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:16,394 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:16,466 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:16,474 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:16,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:16,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:16,478 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:16,479 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1, ULTIMATE.start_main_~nondetString~0.offset) = -1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1 - 1*ULTIMATE.start_main_~nondetString~0.offset Supporting invariants [] [2019-10-22 08:59:16,498 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:16,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:16,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:16,584 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 08:59:16,599 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 08:59:16,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:59:16,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2019-10-22 08:59:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-10-22 08:59:16,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:16,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:16,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:16,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:16,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:59:16,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:16,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 58 transitions. [2019-10-22 08:59:16,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:16,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 18 transitions. [2019-10-22 08:59:16,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:59:16,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:59:16,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-10-22 08:59:16,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:16,692 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-10-22 08:59:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:59:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:59:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-10-22 08:59:16,717 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:16,717 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 08:59:16,718 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:16,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-10-22 08:59:16,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:16,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:16,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:16,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:16,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:16,720 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 128#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~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.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; 129#L535 assume !(main_~length~0 < 1); 136#L535-2 assume !(main_~n~0 < 1); 130#L538-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;main_~i~0 := 0; 131#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 135#L544-4 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; 139#L520-2 [2019-10-22 08:59:16,721 INFO L793 eck$LassoCheckResult]: Loop: 139#L520-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); 140#L522 assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 139#L520-2 [2019-10-22 08:59:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:59:16,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561390719] [2019-10-22 08:59:16,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:16,764 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 1 times [2019-10-22 08:59:16,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700662653] [2019-10-22 08:59:16,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:16,789 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384832, now seen corresponding path program 1 times [2019-10-22 08:59:16,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:16,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503951883] [2019-10-22 08:59:16,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:16,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:16,942 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 08:59:16,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503951883] [2019-10-22 08:59:16,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:16,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:16,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202303710] [2019-10-22 08:59:17,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:17,044 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-10-22 08:59:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:17,145 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-10-22 08:59:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:17,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-10-22 08:59:17,147 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:59:17,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2019-10-22 08:59:17,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:59:17,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:59:17,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-10-22 08:59:17,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:17,148 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:59:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-10-22 08:59:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-22 08:59:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:59:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-10-22 08:59:17,150 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:59:17,150 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:59:17,150 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:17,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-10-22 08:59:17,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:17,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:17,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:17,151 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:17,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:17,152 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#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~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.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; 179#L535 assume !(main_~length~0 < 1); 187#L535-2 assume !(main_~n~0 < 1); 180#L538-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;main_~i~0 := 0; 181#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 185#L544-4 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; 193#L520-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); 192#L522 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 190#L525-3 [2019-10-22 08:59:17,152 INFO L793 eck$LassoCheckResult]: Loop: 190#L525-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 189#L525-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; 190#L525-3 [2019-10-22 08:59:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384817, now seen corresponding path program 1 times [2019-10-22 08:59:17,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:17,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199303999] [2019-10-22 08:59:17,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2019-10-22 08:59:17,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:17,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930142322] [2019-10-22 08:59:17,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2087672522, now seen corresponding path program 1 times [2019-10-22 08:59:17,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:17,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184782069] [2019-10-22 08:59:17,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:17,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:17,215 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:17,760 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 132 [2019-10-22 08:59:17,916 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-10-22 08:59:17,918 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:17,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:17,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:17,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:17,918 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:17,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:17,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:17,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:17,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration3_Lasso [2019-10-22 08:59:17,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:17,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:17,923 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 08:59:18,247 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-10-22 08:59:18,349 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 08:59:18,351 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 08:59:18,352 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 08:59:18,354 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 08:59:18,357 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 08:59:18,358 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 08:59:18,368 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 08:59:18,370 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 08:59:18,371 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 08:59:18,373 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 08:59:18,374 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 08:59:18,376 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 08:59:18,378 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 08:59:18,379 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 08:59:18,380 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 08:59:18,382 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 08:59:18,383 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 08:59:18,384 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 08:59:18,386 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 08:59:18,388 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 08:59:18,389 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 08:59:18,390 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 08:59:18,391 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 08:59:18,394 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 08:59:18,592 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-22 08:59:19,213 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:59:19,268 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:19,268 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:19,269 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 08:59:19,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:19,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:19,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:19,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:19,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:19,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:19,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:19,281 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 08:59:19,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:19,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:19,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:19,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:19,283 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:19,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:19,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:19,287 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 08:59:19,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:19,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:19,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:19,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:19,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:19,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:19,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:19,291 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 08:59:19,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:19,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:19,292 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:19,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:19,316 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:59:19,318 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:19,706 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:20,050 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:20,052 INFO L444 ModelExtractionUtils]: 103 out of 111 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:59:20,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:20,054 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 08:59:20,056 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:20,056 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 08:59:20,101 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:59:20,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:20,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:59:20,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:20,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:59:20,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:20,179 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 08:59:20,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2019-10-22 08:59:20,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-10-22 08:59:20,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-10-22 08:59:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-10-22 08:59:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:59:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:59:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:59:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:20,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-10-22 08:59:20,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:20,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 11 states and 14 transitions. [2019-10-22 08:59:20,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:59:20,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:20,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:59:20,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:20,243 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:59:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:59:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:59:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:59:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 08:59:20,245 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:59:20,245 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:59:20,245 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:20,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 08:59:20,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:20,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:20,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:20,250 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:20,250 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:20,250 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 340#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~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.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; 341#L535 assume !(main_~length~0 < 1); 348#L535-2 assume !(main_~n~0 < 1); 342#L538-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;main_~i~0 := 0; 343#L544-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 344#L544-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 345#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 347#L544-4 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; 349#L520-2 [2019-10-22 08:59:20,250 INFO L793 eck$LassoCheckResult]: Loop: 349#L520-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); 350#L522 assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 349#L520-2 [2019-10-22 08:59:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-10-22 08:59:20,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:20,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696105867] [2019-10-22 08:59:20,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:20,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 2 times [2019-10-22 08:59:20,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:20,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494083196] [2019-10-22 08:59:20,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,284 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626526, now seen corresponding path program 1 times [2019-10-22 08:59:20,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:20,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144010349] [2019-10-22 08:59:20,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:20,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:20,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:20,691 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2019-10-22 08:59:20,803 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 08:59:20,805 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:20,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:20,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:20,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:20,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:20,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:20,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:20,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:20,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration4_Lasso [2019-10-22 08:59:20,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:20,806 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:20,809 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 08:59:20,811 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 08:59:20,813 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 08:59:20,815 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 08:59:20,817 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 08:59:20,819 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 08:59:20,820 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 08:59:20,822 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 08:59:20,824 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 08:59:20,826 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 08:59:20,827 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 08:59:20,829 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 08:59:20,832 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 08:59:20,834 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 08:59:20,835 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 08:59:20,838 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 08:59:20,839 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 08:59:20,841 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 08:59:20,843 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 08:59:20,845 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 08:59:20,847 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 08:59:20,849 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 08:59:20,851 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 08:59:20,852 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 08:59:21,104 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-22 08:59:21,215 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-22 08:59:21,215 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 08:59:21,217 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 08:59:21,221 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 08:59:22,000 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:22,015 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:22,015 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:22,016 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 08:59:22,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,019 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 08:59:22,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,021 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 08:59:22,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,023 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 08:59:22,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,027 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 08:59:22,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,029 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 08:59:22,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,030 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,031 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 08:59:22,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,033 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 08:59:22,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,036 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 08:59:22,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,037 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,038 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 08:59:22,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,039 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,040 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 08:59:22,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,041 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,043 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 08:59:22,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,047 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 08:59:22,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,049 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 08:59:22,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,052 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 08:59:22,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,055 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 08:59:22,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,057 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 08:59:22,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,059 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 08:59:22,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,061 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 08:59:22,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,064 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 08:59:22,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,066 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 08:59:22,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,069 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 08:59:22,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,071 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 08:59:22,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,073 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 08:59:22,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,076 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 08:59:22,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:22,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:22,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:22,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,078 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 08:59:22,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,085 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 08:59:22,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,088 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 08:59:22,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,090 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,090 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:22,095 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 08:59:22,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:22,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:22,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:22,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:22,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:22,098 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:22,118 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:22,135 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:22,135 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:22,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:22,137 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:22,137 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:22,137 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-10-22 08:59:22,162 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:22,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:22,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:22,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:22,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:22,207 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 08:59:22,208 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 08:59:22,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:59:22,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 4 states. [2019-10-22 08:59:22,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 08:59:22,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:59:22,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:22,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:59:22,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:22,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:59:22,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:22,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-10-22 08:59:22,215 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:22,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-10-22 08:59:22,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:22,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:22,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:22,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:22,216 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:22,216 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:22,216 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:22,216 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:22,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:22,216 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:22,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:22,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:22 BoogieIcfgContainer [2019-10-22 08:59:22,222 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:22,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:22,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:22,222 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:22,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:15" (3/4) ... [2019-10-22 08:59:22,226 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:22,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:22,228 INFO L168 Benchmark]: Toolchain (without parser) took 8044.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 101.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,228 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:22,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,229 INFO L168 Benchmark]: Boogie Preprocessor took 51.38 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,229 INFO L168 Benchmark]: RCFGBuilder took 332.93 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,230 INFO L168 Benchmark]: BuchiAutomizer took 7076.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.4 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:22,230 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:22,233 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 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 533.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.87 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.38 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.93 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7076.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.4 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString] + -1 * nondetString and consists of 5 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function n and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 67 SDslu, 64 SDs, 0 SdLazy, 60 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax109 hnf99 lsp86 ukn84 mio100 lsp46 div100 bol100 ite100 ukn100 eq184 hnf88 smp98 dnf199 smp96 tf100 neg95 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 764ms VariablesStem: 21 VariablesLoop: 13 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...