./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:36,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:36,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:36,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:36,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:36,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:36,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:36,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:36,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:36,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:36,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:36,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:36,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:36,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:36,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:36,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:36,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:36,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:36,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:36,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:36,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:36,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:36,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:36,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:36,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:36,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:36,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:36,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:36,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:36,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:36,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:36,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:36,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:36,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:36,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:36,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:36,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:36,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:36,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:36,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:36,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:36,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:36,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:36,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:36,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:36,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:36,679 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:36,680 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:36,680 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:36,680 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:36,680 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:36,680 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:36,680 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:36,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:36,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:36,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:36,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:36,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:36,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:36,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:36,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:36,683 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:36,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:36,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:36,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:36,685 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:36,685 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_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 [2019-10-22 08:54:36,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:36,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:36,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:36,722 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:36,722 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:36,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i [2019-10-22 08:54:36,773 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/data/db9f265cf/d259a6a13e19498986f5251a65f77cf8/FLAG81ad54ed4 [2019-10-22 08:54:37,203 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:37,204 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/sv-benchmarks/c/termination-15/cstrncpy_diffterm_alloca.i [2019-10-22 08:54:37,213 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/data/db9f265cf/d259a6a13e19498986f5251a65f77cf8/FLAG81ad54ed4 [2019-10-22 08:54:37,228 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/bin/uautomizer/data/db9f265cf/d259a6a13e19498986f5251a65f77cf8 [2019-10-22 08:54:37,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:37,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:37,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:37,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:37,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:37,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a31e395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37, skipping insertion in model container [2019-10-22 08:54:37,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,250 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:37,282 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:37,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:37,627 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:37,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:37,738 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:37,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37 WrapperNode [2019-10-22 08:54:37,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:37,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:37,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:37,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:37,748 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:54:37" (1/1) ... [2019-10-22 08:54:37,762 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:54:37" (1/1) ... [2019-10-22 08:54:37,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:37,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:37,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:37,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:37,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... [2019-10-22 08:54:37,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:37,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:37,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:37,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:37,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54dd466f-fe47-4a3f-8115-6456dfeed93e/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:54:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:37,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:37,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:38,054 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:38,055 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:38,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:38 BoogieIcfgContainer [2019-10-22 08:54:38,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:38,056 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:38,057 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:38,060 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:38,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:38,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:37" (1/3) ... [2019-10-22 08:54:38,062 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4163da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:38, skipping insertion in model container [2019-10-22 08:54:38,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:38,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:37" (2/3) ... [2019-10-22 08:54:38,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4163da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:38, skipping insertion in model container [2019-10-22 08:54:38,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:38,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:38" (3/3) ... [2019-10-22 08:54:38,064 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_diffterm_alloca.i [2019-10-22 08:54:38,107 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:38,107 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:38,107 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:38,107 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:38,107 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:38,107 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:38,107 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:38,108 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:38,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:38,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:54:38,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:38,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:38,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:38,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:38,170 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:38,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:54:38,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:54:38,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:38,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:38,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:38,172 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:38,179 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 4#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 14#L370-2true [2019-10-22 08:54:38,180 INFO L793 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(49 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2019-10-22 08:54:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:54:38,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369595666] [2019-10-22 08:54:38,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-10-22 08:54:38,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682243884] [2019-10-22 08:54:38,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,346 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-10-22 08:54:38,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:38,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091738260] [2019-10-22 08:54:38,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:38,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:38,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:38,550 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-22 08:54:38,897 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-10-22 08:54:39,002 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-10-22 08:54:39,014 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:39,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:39,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:39,016 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:39,016 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:39,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:39,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:39,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:39,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca.i_Iteration1_Lasso [2019-10-22 08:54:39,017 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:39,017 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:39,045 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:54:39,051 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:54:39,053 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:54:39,056 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:54:39,062 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:54:39,503 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-22 08:54:39,661 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-22 08:54:39,662 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:54:39,665 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:54:39,668 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:54:39,670 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:54:39,673 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:54:39,675 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:54:39,677 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:54:39,679 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:54:39,682 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:54:39,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:54:39,686 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:54:39,688 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:54:39,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:54:39,693 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:54:39,696 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:54:39,698 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:54:39,703 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:54:40,397 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:54:40,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:40,478 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:40,486 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:54:40,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:40,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,490 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:40,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:40,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,504 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:54:40,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:40,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,506 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:40,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:40,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,507 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:54:40,507 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,507 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:40,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,508 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:40,508 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:40,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,510 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:54:40,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,512 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:40,512 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:40,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,529 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:54:40,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:40,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:40,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:40,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,532 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:54:40,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:40,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:40,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:40,544 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:54:40,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:40,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:40,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:40,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:40,557 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:40,557 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:40,628 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:40,716 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:54:40,724 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:40,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:40,727 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:40,727 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:40,728 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:54:40,761 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-10-22 08:54:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:40,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:40,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:40,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:40,849 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:54:40,859 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:54:40,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-10-22 08:54:40,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-10-22 08:54:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-10-22 08:54:40,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:40,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:40,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:40,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:40,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:40,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:40,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 08:54:40,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:40,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-10-22 08:54:40,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:54:40,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:54:40,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:54:40,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:40,909 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:54:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:54:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:54:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:54:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:54:40,932 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:40,932 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:54:40,932 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:40,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:54:40,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:40,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:40,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:40,933 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:40,933 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:40,933 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 145#L385 assume !(main_~length~0 < 1); 150#L385-2 assume !(main_~n~0 < 1); 148#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 149#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 141#L372 assume 49 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L375-3 [2019-10-22 08:54:40,933 INFO L793 eck$LassoCheckResult]: Loop: 143#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(49, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 143#L375-3 [2019-10-22 08:54:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-10-22 08:54:40,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52379045] [2019-10-22 08:54:40,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:40,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-10-22 08:54:40,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822965324] [2019-10-22 08:54:40,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:40,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-10-22 08:54:40,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:40,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666091674] [2019-10-22 08:54:40,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:40,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:41,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:41,550 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 131 [2019-10-22 08:54:41,683 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-10-22 08:54:41,685 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:41,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:41,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:41,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:41,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:41,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:41,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:41,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:41,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca.i_Iteration2_Lasso [2019-10-22 08:54:41,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:41,690 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:41,694 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:54:41,706 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:54:41,708 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:54:41,709 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:54:41,711 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:54:42,006 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-22 08:54:42,087 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:54:42,090 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:54:42,091 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:54:42,093 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:54:42,094 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:54:42,095 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:54:42,097 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:54:42,098 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:54:42,099 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:54:42,100 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:54:42,101 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:54:42,103 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:54:42,104 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:54:42,105 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:54:42,106 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:54:42,311 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-22 08:54:42,714 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:54:42,911 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:42,911 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:42,911 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:54:42,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,914 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:54:42,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,915 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,916 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:54:42,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,917 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,918 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,918 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:54:42,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,919 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,920 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,920 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:54:42,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,923 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:54:42,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:42,925 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:42,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,928 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:54:42,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,928 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:42,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,934 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:42,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:42,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,960 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:54:42,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,962 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:42,962 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:42,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,965 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:54:42,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,967 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:42,967 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:42,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,970 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:54:42,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:42,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:42,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:42,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,972 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:54:42,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:42,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,974 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:42,974 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:42,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:42,977 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:54:42,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:42,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:42,978 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:42,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:42,991 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:54:42,991 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:54:43,232 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:43,404 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:54:43,405 INFO L444 ModelExtractionUtils]: 83 out of 91 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:43,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:43,407 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 08:54:43,408 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:43,408 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2019-10-22 08:54:43,459 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 08:54:43,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:43,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:43,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:43,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:43,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:43,526 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:54:43,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-10-22 08:54:43,526 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:54:43,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-10-22 08:54:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:54:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 08:54:43,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:43,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:54:43,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:43,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:54:43,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:43,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-10-22 08:54:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:43,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:43,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:43,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:43,562 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:43,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:43,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:43 BoogieIcfgContainer [2019-10-22 08:54:43,572 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:43,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:43,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:43,573 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:43,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:38" (3/4) ... [2019-10-22 08:54:43,576 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:43,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:43,578 INFO L168 Benchmark]: Toolchain (without parser) took 6345.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 939.1 MB in the beginning and 930.4 MB in the end (delta: 8.7 MB). Peak memory consumption was 198.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,578 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:43,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:43,581 INFO L168 Benchmark]: Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,581 INFO L168 Benchmark]: RCFGBuilder took 254.57 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,582 INFO L168 Benchmark]: BuchiAutomizer took 5515.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 159.2 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,583 INFO L168 Benchmark]: Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory was 936.6 MB in the beginning and 930.4 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:43,585 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 254.57 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5515.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 936.6 MB in the end (delta: 159.2 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.81 ms. Allocated memory is still 1.2 GB. Free memory was 936.6 MB in the beginning and 930.4 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 26 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax100 hnf99 lsp96 ukn87 mio100 lsp41 div100 bol100 ite100 ukn100 eq196 hnf89 smp96 dnf226 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 430ms VariablesStem: 17 VariablesLoop: 12 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...