./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/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_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/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-aa41828 [2018-11-22 22:39:18,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:39:18,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:39:18,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:39:18,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:39:18,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:39:18,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:39:18,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:39:18,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:39:18,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:39:18,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:39:18,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:39:18,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:39:18,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:39:18,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:39:18,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:39:18,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:39:18,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:39:18,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:39:18,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:39:18,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:39:18,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:39:18,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:39:18,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:39:18,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:39:18,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:39:18,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:39:18,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:39:18,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:39:18,970 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:39:18,970 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:39:18,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:39:18,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:39:18,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:39:18,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:39:18,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:39:18,973 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:39:18,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:39:18,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:39:18,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:39:18,985 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:39:18,985 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:39:18,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:39:18,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:39:18,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:39:18,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:39:18,988 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:39:18,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:39:18,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:39:18,988 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:39:18,989 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:39:18,989 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_da318c22-de69-4ad1-b459-a6513d4268ae/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-11-22 22:39:19,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:39:19,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:39:19,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:39:19,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:39:19,025 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:39:19,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-22 22:39:19,063 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/data/184a53bd7/2ff1fd58cf5f49f184e303d3d7d10fa5/FLAGbfba9e314 [2018-11-22 22:39:19,480 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:39:19,481 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-22 22:39:19,487 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/data/184a53bd7/2ff1fd58cf5f49f184e303d3d7d10fa5/FLAGbfba9e314 [2018-11-22 22:39:19,497 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/data/184a53bd7/2ff1fd58cf5f49f184e303d3d7d10fa5 [2018-11-22 22:39:19,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:39:19,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:39:19,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:39:19,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:39:19,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:39:19,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76880c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19, skipping insertion in model container [2018-11-22 22:39:19,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:39:19,537 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:39:19,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:39:19,720 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:39:19,791 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:39:19,820 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:39:19,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19 WrapperNode [2018-11-22 22:39:19,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:39:19,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:39:19,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:39:19,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:39:19,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:39:19,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:39:19,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:39:19,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:39:19,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... [2018-11-22 22:39:19,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:39:19,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:39:19,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:39:19,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:39:19,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_da318c22-de69-4ad1-b459-a6513d4268ae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:39:19,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:39:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:39:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:39:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:39:19,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:39:19,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:39:20,085 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:39:20,085 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 22:39:20,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:39:20 BoogieIcfgContainer [2018-11-22 22:39:20,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:39:20,086 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:39:20,086 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:39:20,089 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:39:20,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:39:20,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:39:19" (1/3) ... [2018-11-22 22:39:20,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c2a59bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:39:20, skipping insertion in model container [2018-11-22 22:39:20,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:39:20,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:39:19" (2/3) ... [2018-11-22 22:39:20,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c2a59bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:39:20, skipping insertion in model container [2018-11-22 22:39:20,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:39:20,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:39:20" (3/3) ... [2018-11-22 22:39:20,093 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-22 22:39:20,135 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:39:20,136 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:39:20,136 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:39:20,136 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:39:20,136 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:39:20,136 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:39:20,136 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:39:20,136 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:39:20,136 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:39:20,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:39:20,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-22 22:39:20,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:39:20,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:39:20,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:39:20,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:39:20,166 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:39:20,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-22 22:39:20,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-22 22:39:20,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:39:20,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:39:20,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 22:39:20,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:39:20,173 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-11-22 22:39:20,173 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-11-22 22:39:20,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:20,178 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-22 22:39:20,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2018-11-22 22:39:20,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2018-11-22 22:39:20,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:20,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:20,737 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2018-11-22 22:39:20,833 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:39:20,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:39:20,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:39:20,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:39:20,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:39:20,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:39:20,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:39:20,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:39:20,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-22 22:39:20,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:39:20,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:39:20,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:20,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:20,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:20,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:20,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:20,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,107 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-11-22 22:39:21,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,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-11-22 22:39:21,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-11-22 22:39:21,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-11-22 22:39:21,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:21,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-11-22 22:39:21,440 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-22 22:39:21,547 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-22 22:39:21,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:39:21,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:39:21,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:21,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:21,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:21,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:21,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:39:21,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:39:21,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:21,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:21,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:21,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,845 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:39:21,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:39:21,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:21,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:21,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:21,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:21,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:21,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:21,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:21,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:21,952 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:39:22,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:39:22,002 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 22:39:22,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:39:22,006 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:39:22,006 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:39:22,006 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-11-22 22:39:22,054 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-22 22:39:22,061 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:39:22,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:39:22,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:39:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:39:22,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:39:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:39:22,160 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-11-22 22:39:22,161 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-11-22 22:39:22,211 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-11-22 22:39:22,211 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-11-22 22:39:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:39:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-22 22:39:22,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-22 22:39:22,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:22,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-22 22:39:22,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:22,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-22 22:39:22,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:22,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-11-22 22:39:22,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:39:22,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2018-11-22 22:39:22,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:39:22,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:39:22,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-22 22:39:22,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:39:22,224 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:39:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-22 22:39:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-22 22:39:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:39:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-22 22:39:22,240 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:39:22,240 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-22 22:39:22,240 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:39:22,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-22 22:39:22,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:39:22,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:39:22,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:39:22,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:39:22,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:39:22,241 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-11-22 22:39:22,241 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-11-22 22:39:22,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2018-11-22 22:39:22,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2018-11-22 22:39:22,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2018-11-22 22:39:22,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:22,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:22,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:22,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:22,541 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-22 22:39:22,641 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:39:22,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:39:22,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:39:22,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:39:22,641 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:39:22,641 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:39:22,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:39:22,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:39:22,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-22 22:39:22,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:39:22,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:39:22,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:22,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:39:23,133 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:39:23,134 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:39:23,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:39:23,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:39:23,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:39:23,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:39:23,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,199 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:39:23,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,202 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 22:39:23,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,204 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 22:39:23,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:39:23,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:39:23,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:39:23,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:39:23,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:39:23,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:39:23,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:39:23,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:39:23,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:39:23,233 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:39:23,233 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:39:23,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:39:23,235 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 22:39:23,235 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:39:23,235 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-11-22 22:39:23,264 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-22 22:39:23,266 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 22:39:23,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:39:23,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:39:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:39:23,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:39:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:39:23,315 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-11-22 22:39:23,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-22 22:39:23,333 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-11-22 22:39:23,334 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-11-22 22:39:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:39:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-22 22:39:23,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-22 22:39:23,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:23,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-22 22:39:23,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:23,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-22 22:39:23,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:39:23,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-22 22:39:23,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:39:23,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2018-11-22 22:39:23,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:39:23,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:39:23,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-22 22:39:23,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:39:23,337 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-22 22:39:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-22 22:39:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-22 22:39:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:39:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-22 22:39:23,337 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-22 22:39:23,338 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-22 22:39:23,338 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:39:23,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-22 22:39:23,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 22:39:23,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:39:23,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:39:23,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:39:23,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 22:39:23,342 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-11-22 22:39:23,342 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-11-22 22:39:23,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2018-11-22 22:39:23,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:23,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:23,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:39:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:39:23,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:39:23,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:39:23,396 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:39:23,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:39:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2018-11-22 22:39:23,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:39:23,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:39:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:39:23,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:39:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:39:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:39:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:39:23,431 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-22 22:39:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:39:23,444 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-11-22 22:39:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:39:23,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-11-22 22:39:23,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:39:23,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:39:23,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:39:23,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:39:23,446 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:39:23,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:39:23,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:39:23,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:39:23,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:39:23 BoogieIcfgContainer [2018-11-22 22:39:23,450 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:39:23,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:39:23,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:39:23,451 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:39:23,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:39:20" (3/4) ... [2018-11-22 22:39:23,453 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:39:23,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:39:23,454 INFO L168 Benchmark]: Toolchain (without parser) took 3954.52 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 950.4 MB in the beginning and 1.3 GB in the end (delta: -305.0 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:39:23,455 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:39:23,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:39:23,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:39:23,456 INFO L168 Benchmark]: Boogie Preprocessor took 18.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:39:23,456 INFO L168 Benchmark]: RCFGBuilder took 218.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:39:23,456 INFO L168 Benchmark]: BuchiAutomizer took 3364.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -137.1 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:39:23,457 INFO L168 Benchmark]: Witness Printer took 2.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:39:23,459 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 950.4 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 218.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3364.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -137.1 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. 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: 46 SDtfs, 42 SDslu, 34 SDs, 0 SdLazy, 20 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 div150 bol100 ite100 ukn100 eq166 hnf75 smp97 dnf100 smp100 tf100 neg99 sie101 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...