./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:06,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:06,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:06,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:06,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:06,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:06,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:06,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:06,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:06,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:06,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:06,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:06,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:06,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:06,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:06,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:06,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:06,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:06,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:06,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:06,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:06,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:06,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:06,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:06,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:06,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:06,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:06,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:06,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:06,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:06,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:06,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:06,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:06,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:06,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:06,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:06,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:06,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:06,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:06,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:06,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:06,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:06,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:06,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:06,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:06,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:06,336 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:06,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:06,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:06,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:06,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:06,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:06,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:06,340 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:06,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:06,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:06,340 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:06,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:06,341 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb6ff0b2d9abd29a15d3eb2d5a86a23b460e9725 [2019-10-22 08:59:06,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:06,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:06,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:06,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:06,407 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:06,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-10-22 08:59:06,464 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/data/bbc48839e/d9960accf0324727bc45019f11b59acc/FLAG315ec8c12 [2019-10-22 08:59:06,849 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:06,849 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/sv-benchmarks/c/array-memsafety/openbsd_cstrcat-alloca-2.i [2019-10-22 08:59:06,872 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/data/bbc48839e/d9960accf0324727bc45019f11b59acc/FLAG315ec8c12 [2019-10-22 08:59:07,214 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/data/bbc48839e/d9960accf0324727bc45019f11b59acc [2019-10-22 08:59:07,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:07,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:07,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:07,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:07,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:07,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704f5040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07, skipping insertion in model container [2019-10-22 08:59:07,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,235 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:07,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:07,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,707 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:07,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:07,803 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:07,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07 WrapperNode [2019-10-22 08:59:07,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:07,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:07,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:07,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:07,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:07,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:07,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... [2019-10-22 08:59:07,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:07,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:07,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:07,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:07,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80b0c07b-8e46-4914-ab06-5de5a4f2b6be/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:07,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:07,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:08,302 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:08,303 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:59:08,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08 BoogieIcfgContainer [2019-10-22 08:59:08,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:08,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:08,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:08,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:08,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:07" (1/3) ... [2019-10-22 08:59:08,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d579eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:08, skipping insertion in model container [2019-10-22 08:59:08,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:07" (2/3) ... [2019-10-22 08:59:08,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54d579eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:08, skipping insertion in model container [2019-10-22 08:59:08,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:08,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08" (3/3) ... [2019-10-22 08:59:08,314 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcat-alloca-2.i [2019-10-22 08:59:08,391 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:08,391 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:08,391 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:08,392 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:08,392 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:08,392 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:08,392 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:08,392 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:08,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:59:08,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-10-22 08:59:08,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,447 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:08,448 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:08,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-10-22 08:59:08,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2019-10-22 08:59:08,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,452 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:08,452 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:08,461 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L525true assume !(main_~length1~0 < 1); 12#L525-2true assume !(main_~length2~0 < 2); 24#L528-1true assume !(main_~length3~0 < 1); 15#L531-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 9#L538-3true [2019-10-22 08:59:08,464 INFO L793 eck$LassoCheckResult]: Loop: 9#L538-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6#L538-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 9#L538-3true [2019-10-22 08:59:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-10-22 08:59:08,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292991418] [2019-10-22 08:59:08,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,658 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-10-22 08:59:08,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870173987] [2019-10-22 08:59:08,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-10-22 08:59:08,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171160694] [2019-10-22 08:59:08,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:09,081 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-22 08:59:09,191 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:09,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:09,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:09,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:09,194 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:09,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:09,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:09,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:09,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration1_Lasso [2019-10-22 08:59:09,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:09,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:09,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,457 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-22 08:59:09,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,959 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:09,989 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:09,998 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:10,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,032 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,032 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,095 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,103 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,103 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,119 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,140 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,140 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:10,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:10,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:10,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:10,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:10,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:10,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:10,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:10,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:10,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:10,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:10,296 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:10,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:10,333 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:10,335 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:10,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:10,337 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:10,338 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:59:10,356 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:10,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:10,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:10,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:10,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-10-22 08:59:10,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 55 states and 77 transitions. Complement of second has 7 states. [2019-10-22 08:59:10,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2019-10-22 08:59:10,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:59:10,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:59:10,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:10,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:10,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 77 transitions. [2019-10-22 08:59:10,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:59:10,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 18 states and 25 transitions. [2019-10-22 08:59:10,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:59:10,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:59:10,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:59:10,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:10,581 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:59:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:59:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:59:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:59:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:59:10,610 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:59:10,611 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:59:10,611 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:10,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:59:10,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:59:10,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:10,614 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 165#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 158#L525 assume !(main_~length1~0 < 1); 159#L525-2 assume !(main_~length2~0 < 2); 164#L528-1 assume !(main_~length3~0 < 1); 167#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 161#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 162#L538-4 main_~i~1 := 0; 163#L542-3 [2019-10-22 08:59:10,614 INFO L793 eck$LassoCheckResult]: Loop: 163#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 168#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 163#L542-3 [2019-10-22 08:59:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-10-22 08:59:10,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626231290] [2019-10-22 08:59:10,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,656 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-10-22 08:59:10,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231092500] [2019-10-22 08:59:10,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,672 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-10-22 08:59:10,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741898253] [2019-10-22 08:59:10,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,708 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,959 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-10-22 08:59:11,025 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:11,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:11,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:11,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:11,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:11,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:11,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:11,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:11,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration2_Lasso [2019-10-22 08:59:11,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:11,027 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:11,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:11,566 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:11,606 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:11,606 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:11,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:11,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,608 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:11,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,612 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:11,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:11,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:11,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:11,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:11,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:11,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:11,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:11,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:11,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:11,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:11,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:11,659 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:11,689 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:11,689 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:11,690 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:11,691 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:11,691 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:11,691 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length3~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length3~0 Supporting invariants [] [2019-10-22 08:59:11,707 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:59:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:11,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:11,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:11,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:11,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:11,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:59:11,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 26 states and 38 transitions. Complement of second has 6 states. [2019-10-22 08:59:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 08:59:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:59:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:59:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 08:59:11,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:11,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2019-10-22 08:59:11,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:11,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 27 transitions. [2019-10-22 08:59:11,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:59:11,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:59:11,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2019-10-22 08:59:11,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:11,788 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 08:59:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2019-10-22 08:59:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:59:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:59:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-10-22 08:59:11,794 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 08:59:11,794 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-10-22 08:59:11,794 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:11,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-10-22 08:59:11,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:11,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:11,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:11,795 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:11,795 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:11,796 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 279#L525 assume !(main_~length1~0 < 1); 280#L525-2 assume !(main_~length2~0 < 2); 285#L528-1 assume !(main_~length3~0 < 1); 288#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 282#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 283#L538-4 main_~i~1 := 0; 284#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 291#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 281#L517-4 [2019-10-22 08:59:11,796 INFO L793 eck$LassoCheckResult]: Loop: 281#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 273#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 275#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 281#L517-4 [2019-10-22 08:59:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-10-22 08:59:11,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21286651] [2019-10-22 08:59:11,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 1 times [2019-10-22 08:59:11,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478589303] [2019-10-22 08:59:11,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:11,858 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:11,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1045403964, now seen corresponding path program 1 times [2019-10-22 08:59:11,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:11,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774765221] [2019-10-22 08:59:11,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:11,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:12,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774765221] [2019-10-22 08:59:12,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:12,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:59:12,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991447119] [2019-10-22 08:59:12,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:59:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:59:12,085 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-10-22 08:59:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:12,171 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-10-22 08:59:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:59:12,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-10-22 08:59:12,173 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:59:12,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-10-22 08:59:12,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:59:12,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:59:12,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-10-22 08:59:12,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:12,175 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-22 08:59:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-10-22 08:59:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-10-22 08:59:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:59:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-10-22 08:59:12,177 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:59:12,177 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:59:12,178 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-10-22 08:59:12,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:59:12,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:12,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:12,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:12,183 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:12,183 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 349#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 340#L525 assume !(main_~length1~0 < 1); 341#L525-2 assume !(main_~length2~0 < 2); 348#L528-1 assume !(main_~length3~0 < 1); 351#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 344#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 345#L538-4 main_~i~1 := 0; 347#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 354#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 346#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 335#L517-1 assume !(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 336#L518-2 [2019-10-22 08:59:12,183 INFO L793 eck$LassoCheckResult]: Loop: 336#L518-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s.base, cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~append.base, cstrcat_~append.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 337#L518 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset; 336#L518-2 [2019-10-22 08:59:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1696290690, now seen corresponding path program 1 times [2019-10-22 08:59:12,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138699575] [2019-10-22 08:59:12,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,217 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash 3238, now seen corresponding path program 1 times [2019-10-22 08:59:12,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568246469] [2019-10-22 08:59:12,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,232 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1952217113, now seen corresponding path program 1 times [2019-10-22 08:59:12,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602798436] [2019-10-22 08:59:12,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:12,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602798436] [2019-10-22 08:59:12,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:12,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:12,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619934527] [2019-10-22 08:59:12,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:59:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:59:12,442 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:59:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:12,570 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-10-22 08:59:12,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:12,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-10-22 08:59:12,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 08:59:12,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 40 transitions. [2019-10-22 08:59:12,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:59:12,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:59:12,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-10-22 08:59:12,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:12,573 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 08:59:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-10-22 08:59:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-22 08:59:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:59:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 08:59:12,580 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:59:12,580 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 08:59:12,580 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:12,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-10-22 08:59:12,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-10-22 08:59:12,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:12,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:12,581 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:12,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:12,586 INFO L791 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 426#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 415#L525 assume !(main_~length1~0 < 1); 416#L525-2 assume !(main_~length2~0 < 2); 425#L528-1 assume !(main_~length3~0 < 1); 428#L531-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);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.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 419#L538-3 assume !(main_~i~0 < main_~length1~0 - 1); 420#L538-4 main_~i~1 := 0; 438#L542-3 assume !!(main_~i~1 < main_~length3~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 436#L542-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 435#L542-3 assume !(main_~i~1 < main_~length3~0 - 1); 434#L542-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s.base, cstrcat_#in~s.offset, cstrcat_#in~append.base, cstrcat_#in~append.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset, cstrcat_#t~mem3, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s.base, cstrcat_~s.offset, cstrcat_~append.base, cstrcat_~append.offset, cstrcat_~save~0.base, cstrcat_~save~0.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_#in~s.base, cstrcat_#in~s.offset;cstrcat_~append.base, cstrcat_~append.offset := cstrcat_#in~append.base, cstrcat_#in~append.offset;cstrcat_~save~0.base, cstrcat_~save~0.offset := cstrcat_~s.base, cstrcat_~s.offset; 433#L517-4 [2019-10-22 08:59:12,586 INFO L793 eck$LassoCheckResult]: Loop: 433#L517-4 call cstrcat_#t~mem3 := read~int(cstrcat_~s.base, cstrcat_~s.offset, 1); 409#L517-1 assume !!(0 != cstrcat_#t~mem3);havoc cstrcat_#t~mem3; 410#L517-3 cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;cstrcat_~s.base, cstrcat_~s.offset := cstrcat_~s.base, 1 + cstrcat_~s.offset;havoc cstrcat_#t~pre2.base, cstrcat_#t~pre2.offset; 433#L517-4 [2019-10-22 08:59:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-10-22 08:59:12,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312715293] [2019-10-22 08:59:12,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 86554, now seen corresponding path program 2 times [2019-10-22 08:59:12,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156969137] [2019-10-22 08:59:12,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:12,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1259997786, now seen corresponding path program 1 times [2019-10-22 08:59:12,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:12,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548730786] [2019-10-22 08:59:12,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:12,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:12,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:13,068 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-10-22 08:59:13,220 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-10-22 08:59:13,222 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:13,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:13,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:13,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:13,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:13,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:13,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:13,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:13,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcat-alloca-2.i_Iteration5_Lasso [2019-10-22 08:59:13,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:13,223 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:13,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,509 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-10-22 08:59:13,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:13,758 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-22 08:59:14,282 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:59:14,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:14,322 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:14,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:14,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,327 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:14,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:14,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,329 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:14,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:14,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:14,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:14,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:14,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:14,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:14,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:14,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:14,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:14,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:14,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:14,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:14,338 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:14,368 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:14,401 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:14,401 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:14,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:14,403 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:14,403 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:14,403 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s.offset, v_rep(select #length ULTIMATE.start_cstrcat_~s.base)_1) = -1*ULTIMATE.start_cstrcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrcat_~s.base)_1 Supporting invariants [] [2019-10-22 08:59:14,455 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-10-22 08:59:14,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:14,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:14,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:14,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:14,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-10-22 08:59:14,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 40 states and 52 transitions. Complement of second has 6 states. [2019-10-22 08:59:14,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-10-22 08:59:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 3 letters. [2019-10-22 08:59:14,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:59:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 12 letters. Loop has 6 letters. [2019-10-22 08:59:14,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:14,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-10-22 08:59:14,538 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:14,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:14,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:14,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:14,539 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:14,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:14,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:14,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:14,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:14 BoogieIcfgContainer [2019-10-22 08:59:14,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:14,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:14,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:14,550 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:14,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:08" (3/4) ... [2019-10-22 08:59:14,554 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:14,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:14,556 INFO L168 Benchmark]: Toolchain (without parser) took 7338.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:14,556 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:14,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:14,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:14,559 INFO L168 Benchmark]: Boogie Preprocessor took 53.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:14,560 INFO L168 Benchmark]: RCFGBuilder took 392.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:14,560 INFO L168 Benchmark]: BuchiAutomizer took 6244.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -900.8 kB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:14,560 INFO L168 Benchmark]: Witness Printer took 5.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:14,564 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6244.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -900.8 kB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.34 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. * 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * nondetString1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length3 and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 170 SDslu, 126 SDs, 0 SdLazy, 101 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax110 hnf98 lsp83 ukn77 mio100 lsp57 div100 bol100 ite100 ukn100 eq167 hnf90 smp97 dnf146 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...