./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6d213bb73df5e8110170d83073afe858aea401c0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:32:28,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:32:28,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:32:28,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:32:28,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:32:28,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:32:28,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:32:28,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:32:28,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:32:28,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:32:28,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:32:28,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:32:28,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:32:28,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:32:28,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:32:28,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:32:28,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:32:28,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:32:28,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:32:28,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:32:28,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:32:28,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:32:28,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:32:28,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:32:28,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:32:28,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:32:28,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:32:28,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:32:28,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:32:28,711 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:32:28,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:32:28,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:32:28,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:32:28,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:32:28,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:32:28,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:32:28,713 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 00:32:28,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:32:28,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:32:28,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:32:28,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:32:28,721 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:32:28,721 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:32:28,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:32:28,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:32:28,723 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:32:28,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:32:28,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:32:28,724 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:32:28,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:32:28,724 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:32:28,724 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:32:28,725 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:32:28,725 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d213bb73df5e8110170d83073afe858aea401c0 [2018-12-09 00:32:28,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:32:28,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:32:28,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:32:28,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:32:28,752 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:32:28,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-12-09 00:32:28,785 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/data/bbddcc6d5/3234565b1c7045f0a9e985dfb2a21fc1/FLAGa38ae1cfb [2018-12-09 00:32:29,253 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:32:29,254 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-12-09 00:32:29,260 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/data/bbddcc6d5/3234565b1c7045f0a9e985dfb2a21fc1/FLAGa38ae1cfb [2018-12-09 00:32:29,771 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/data/bbddcc6d5/3234565b1c7045f0a9e985dfb2a21fc1 [2018-12-09 00:32:29,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:32:29,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:32:29,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:32:29,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:32:29,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:32:29,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:29" (1/1) ... [2018-12-09 00:32:29,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:29, skipping insertion in model container [2018-12-09 00:32:29,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:29" (1/1) ... [2018-12-09 00:32:29,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:32:29,800 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:32:29,942 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:32:29,948 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:32:30,012 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:32:30,036 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:32:30,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30 WrapperNode [2018-12-09 00:32:30,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:32:30,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:32:30,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:32:30,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:32:30,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:32:30,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:32:30,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:32:30,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:32:30,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... [2018-12-09 00:32:30,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:32:30,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:32:30,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:32:30,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:32:30,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_427d8d8d-78d6-4f61-882e-e50d501926f1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:32:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:32:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:32:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:32:30,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:32:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:32:30,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:32:30,246 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:32:30,246 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:32:30,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:30 BoogieIcfgContainer [2018-12-09 00:32:30,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:32:30,247 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:32:30,247 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:32:30,249 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:32:30,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:32:30,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:32:29" (1/3) ... [2018-12-09 00:32:30,250 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3942947b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:32:30, skipping insertion in model container [2018-12-09 00:32:30,250 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:32:30,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:30" (2/3) ... [2018-12-09 00:32:30,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3942947b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:32:30, skipping insertion in model container [2018-12-09 00:32:30,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:32:30,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:30" (3/3) ... [2018-12-09 00:32:30,252 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-12-09 00:32:30,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:32:30,284 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:32:30,284 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:32:30,284 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:32:30,284 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:32:30,284 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:32:30,284 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:32:30,284 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:32:30,284 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:32:30,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 00:32:30,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 00:32:30,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:32:30,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:32:30,309 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:32:30,309 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:32:30,309 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:32:30,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 00:32:30,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 00:32:30,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:32:30,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:32:30,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:32:30,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:32:30,315 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 19#L570true assume !(main_~length~0 < 1); 3#L570-2true assume !(main_~n~1 < 1); 13#L573-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7#L553true assume 0 != cstrlcpy_~n~0 % 4294967296; 12#L554-3true [2018-12-09 00:32:30,316 INFO L796 eck$LassoCheckResult]: Loop: 12#L554-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 8#L554-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 4#L555true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 12#L554-3true [2018-12-09 00:32:30,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-12-09 00:32:30,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:30,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2018-12-09 00:32:30,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:30,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2018-12-09 00:32:30,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:30,784 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-12-09 00:32:30,874 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:32:30,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:32:30,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:32:30,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:32:30,875 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:32:30,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:32:30,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:32:30,876 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:32:30,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 00:32:30,876 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:32:30,876 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:32:30,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:30,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:30,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:30,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:30,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:30,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,138 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-09 00:32:31,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:31,484 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-09 00:32:31,602 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-09 00:32:31,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:32:31,839 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:32:31,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:31,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:31,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:31,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:31,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,858 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:32:31,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,859 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:32:31,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:31,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:31,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:31,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,877 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:32:31,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,881 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:32:31,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,913 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:32:31,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,915 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:32:31,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:31,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:31,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:31,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:31,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:31,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:31,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:31,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:31,960 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:32:31,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:32:31,981 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:32:31,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:32:31,983 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:32:31,983 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:32:31,983 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-12-09 00:32:32,029 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-12-09 00:32:32,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:32:32,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:32,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:32,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:32,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 00:32:32,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-12-09 00:32:32,183 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 49 states and 70 transitions. Complement of second has 7 states. [2018-12-09 00:32:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:32:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:32:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-12-09 00:32:32,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-09 00:32:32,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:32,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-12-09 00:32:32,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:32,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-09 00:32:32,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:32,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-12-09 00:32:32,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:32:32,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2018-12-09 00:32:32,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 00:32:32,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 00:32:32,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-09 00:32:32,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:32:32,196 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 00:32:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-09 00:32:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 00:32:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 00:32:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-09 00:32:32,216 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 00:32:32,216 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-09 00:32:32,216 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:32:32,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-09 00:32:32,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:32:32,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:32:32,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:32:32,217 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:32,217 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:32:32,217 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 191#L570 assume !(main_~length~0 < 1); 195#L570-2 assume !(main_~n~1 < 1); 196#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 192#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 193#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 197#L560 assume !(0 != cstrlcpy_~siz % 4294967296); 199#L562-2 [2018-12-09 00:32:32,217 INFO L796 eck$LassoCheckResult]: Loop: 199#L562-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 198#L562 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 199#L562-2 [2018-12-09 00:32:32,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:32,217 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2018-12-09 00:32:32,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:32,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:32,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2018-12-09 00:32:32,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:32,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2018-12-09 00:32:32,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:32,445 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2018-12-09 00:32:32,510 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:32:32,511 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:32:32,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:32:32,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:32:32,511 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:32:32,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:32:32,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:32:32,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:32:32,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-09 00:32:32,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:32:32,511 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:32:32,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:32,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:32:33,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:32:33,009 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:32:33,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:33,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:33,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:33,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:33,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:32:33,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:33,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,038 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:32:33,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,039 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:32:33,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:32:33,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,044 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:32:33,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:32:33,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:32:33,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:32:33,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:32:33,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:32:33,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:32:33,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:32:33,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:32:33,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:32:33,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:32:33,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:32:33,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:32:33,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:32:33,069 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:32:33,069 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 00:32:33,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:32:33,070 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:32:33,070 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:32:33,070 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [] [2018-12-09 00:32:33,092 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 00:32:33,094 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:32:33,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:33,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:33,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:33,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 00:32:33,155 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-09 00:32:33,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-12-09 00:32:33,179 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 [2018-12-09 00:32:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:32:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 00:32:33,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 00:32:33,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:33,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-09 00:32:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:33,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 00:32:33,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:32:33,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-09 00:32:33,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:32:33,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2018-12-09 00:32:33,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 00:32:33,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 00:32:33,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-09 00:32:33,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:32:33,181 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 00:32:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-09 00:32:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-09 00:32:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 00:32:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-09 00:32:33,182 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 00:32:33,182 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 00:32:33,182 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:32:33,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-09 00:32:33,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:32:33,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:32:33,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:32:33,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:33,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:32:33,183 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 308#L570 assume !(main_~length~0 < 1); 313#L570-2 assume !(main_~n~1 < 1); 314#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 309#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 310#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 312#L560 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 316#L562-2 [2018-12-09 00:32:33,183 INFO L796 eck$LassoCheckResult]: Loop: 316#L562-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 315#L562 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 316#L562-2 [2018-12-09 00:32:33,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2018-12-09 00:32:33,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:33,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:33,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:32:33,251 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:32:33,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2018-12-09 00:32:33,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:32:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:32:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:33,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:32:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:32:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:32:33,301 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-09 00:32:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:33,311 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-12-09 00:32:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:32:33,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-12-09 00:32:33,312 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:32:33,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2018-12-09 00:32:33,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:32:33,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:32:33,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:32:33,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:32:33,312 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:32:33,312 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:32:33,312 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:32:33,312 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:32:33,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:32:33,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:32:33,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:32:33,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:32:33 BoogieIcfgContainer [2018-12-09 00:32:33,318 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:32:33,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:32:33,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:32:33,318 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:32:33,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:30" (3/4) ... [2018-12-09 00:32:33,322 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:32:33,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:32:33,322 INFO L168 Benchmark]: Toolchain (without parser) took 3548.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -251.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:33,323 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:33,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 58.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:33,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:33,324 INFO L168 Benchmark]: Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:33,324 INFO L168 Benchmark]: RCFGBuilder took 168.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:33,325 INFO L168 Benchmark]: BuchiAutomizer took 3070.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -195.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:33,325 INFO L168 Benchmark]: Witness Printer took 3.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:33,328 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 58.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -85.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3070.82 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -195.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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: 47 SDtfs, 42 SDslu, 28 SDs, 0 SdLazy, 19 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax108 hnf99 lsp90 ukn83 mio100 lsp41 div171 bol100 ite100 ukn100 eq172 hnf66 smp95 dnf100 smp100 tf101 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...