./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-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_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/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 bbb28681f649db641abcf0a1b656085d04f9cc91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:58,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:58,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:58,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:58,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:58,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:58,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:58,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:58,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:58,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:58,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:58,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:58,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:58,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:58,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:58,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:58,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:58,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:58,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:58,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:58,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:58,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:58,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:58,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:58,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:58,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:58,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:58,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:58,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:58,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:58,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:58,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:58,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:58,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:58,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:58,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:58,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:58,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:58,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:58,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:58,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:58,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:58,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:58,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:58,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:58,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:58,342 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:58,342 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:58,342 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:58,342 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:58,343 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:58,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:58,343 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:58,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:58,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:58,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:58,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:58,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:58,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:58,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:58,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:58,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:58,345 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:58,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:58,348 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:58,348 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:58,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:58,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:58,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:58,349 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:58,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:58,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:58,351 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:58,351 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:58,351 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_289f5074-d269-4fa1-877f-83e33c77c6af/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 -> bbb28681f649db641abcf0a1b656085d04f9cc91 [2019-10-22 08:57:58,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:58,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:58,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:58,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:58,398 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:58,399 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-10-22 08:57:58,455 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/data/94a6ea10e/5ef157cbfb564300967dc62e1028d02a/FLAGa165433bd [2019-10-22 08:57:58,891 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:58,892 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2019-10-22 08:57:58,908 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/data/94a6ea10e/5ef157cbfb564300967dc62e1028d02a/FLAGa165433bd [2019-10-22 08:57:59,419 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/data/94a6ea10e/5ef157cbfb564300967dc62e1028d02a [2019-10-22 08:57:59,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:59,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:59,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:59,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:59,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:59,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:59" (1/1) ... [2019-10-22 08:57:59,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f72a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:59, skipping insertion in model container [2019-10-22 08:57:59,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:59" (1/1) ... [2019-10-22 08:57:59,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:59,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:59,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:59,918 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:59,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:00,010 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:00,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00 WrapperNode [2019-10-22 08:58:00,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:00,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:00,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:00,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:00,020 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:58:00" (1/1) ... [2019-10-22 08:58:00,037 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:58:00" (1/1) ... [2019-10-22 08:58:00,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:00,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:00,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:00,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:00,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:00,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:00,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:00,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:00,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/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:58:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:00,512 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:00,512 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 08:58:00,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:00 BoogieIcfgContainer [2019-10-22 08:58:00,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:00,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:00,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:00,518 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:00,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:00,519 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:59" (1/3) ... [2019-10-22 08:58:00,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1347508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:00, skipping insertion in model container [2019-10-22 08:58:00,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:00,521 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (2/3) ... [2019-10-22 08:58:00,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1347508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:00, skipping insertion in model container [2019-10-22 08:58:00,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:00,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:00" (3/3) ... [2019-10-22 08:58:00,523 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2019-10-22 08:58:00,570 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:00,571 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:00,571 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:00,571 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:00,571 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:00,571 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:00,571 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:00,571 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:00,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-10-22 08:58:00,612 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2019-10-22 08:58:00,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:00,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:00,619 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:00,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-10-22 08:58:00,622 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2019-10-22 08:58:00,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:00,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:00,631 INFO L791 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4#L555true assume !(main_~length1~0 < 1); 28#L555-2true assume !(main_~length2~0 < 1); 19#L558-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 35#L564-3true [2019-10-22 08:58:00,631 INFO L793 eck$LassoCheckResult]: Loop: 35#L564-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 32#L564-2true main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 35#L564-3true [2019-10-22 08:58:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:58:00,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50778135] [2019-10-22 08:58:00,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:58:00,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087319764] [2019-10-22 08:58:00,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:58:00,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617405623] [2019-10-22 08:58:00,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,031 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:01,032 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:01,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:01,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:01,033 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:01,033 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:01,033 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:01,033 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:01,033 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2019-10-22 08:58:01,033 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:01,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:01,057 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:58:01,063 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:58:01,065 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:58:01,067 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:58:01,070 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:58:01,072 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:58:01,076 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:58:01,080 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:58:01,082 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:58:01,085 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:58:01,219 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:58:01,225 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:58:01,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:58:01,230 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:58:01,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:58:01,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:58:01,567 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:58:01,680 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:01,688 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:01,690 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:58:01,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,696 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,696 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,701 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:58:01,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,706 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,707 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:58:01,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,712 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,715 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:58:01,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,721 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:58:01,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,724 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:58:01,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,730 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:01,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:01,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,746 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:58:01,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:01,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:01,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,761 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:58:01,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,764 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:58:01,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:01,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:01,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,774 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:58:01,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:01,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,776 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:01,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:01,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,778 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:58:01,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,779 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:01,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,785 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:01,786 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:01,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:01,832 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:58:01,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:01,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:01,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:01,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:01,838 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:01,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:01,882 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:01,935 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:58:01,935 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:01,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:01,939 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:01,939 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:01,940 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:58:01,961 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:58:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:02,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:02,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:02,031 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:58:02,043 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:58:02,044 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-10-22 08:58:02,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 99 states and 145 transitions. Complement of second has 7 states. [2019-10-22 08:58:02,121 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:58:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2019-10-22 08:58:02,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:58:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:58:02,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:02,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:58:02,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:02,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. [2019-10-22 08:58:02,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-10-22 08:58:02,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2019-10-22 08:58:02,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 08:58:02,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:58:02,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-10-22 08:58:02,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:02,138 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:58:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-10-22 08:58:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-22 08:58:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:58:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-10-22 08:58:02,169 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:58:02,170 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-10-22 08:58:02,171 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:02,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-10-22 08:58:02,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-10-22 08:58:02,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:02,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:02,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:02,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:02,173 INFO L791 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 210#L555 assume !(main_~length1~0 < 1); 211#L555-2 assume !(main_~length2~0 < 1); 227#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 228#L564-3 assume !(main_~i~0 < main_~length1~0); 239#L564-4 main_~i~1 := 0; 209#L568-3 [2019-10-22 08:58:02,173 INFO L793 eck$LassoCheckResult]: Loop: 209#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 208#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 209#L568-3 [2019-10-22 08:58:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:58:02,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775414937] [2019-10-22 08:58:02,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,234 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:58:02,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775414937] [2019-10-22 08:58:02,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:02,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:02,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343551588] [2019-10-22 08:58:02,238 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 08:58:02,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523677937] [2019-10-22 08:58:02,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:02,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:02,308 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:58:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:02,336 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-22 08:58:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:02,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-10-22 08:58:02,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-10-22 08:58:02,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 08:58:02,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:58:02,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:58:02,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-10-22 08:58:02,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:02,340 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:58:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-10-22 08:58:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-22 08:58:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:58:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-10-22 08:58:02,343 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-10-22 08:58:02,343 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-10-22 08:58:02,343 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:02,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-10-22 08:58:02,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-10-22 08:58:02,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:02,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:02,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:02,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:02,345 INFO L791 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 289#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 282#L555 assume !(main_~length1~0 < 1); 283#L555-2 assume !(main_~length2~0 < 1); 300#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 301#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 309#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 310#L564-3 assume !(main_~i~0 < main_~length1~0); 311#L564-4 main_~i~1 := 0; 281#L568-3 [2019-10-22 08:58:02,345 INFO L793 eck$LassoCheckResult]: Loop: 281#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 280#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 281#L568-3 [2019-10-22 08:58:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-10-22 08:58:02,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301741810] [2019-10-22 08:58:02,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,375 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2019-10-22 08:58:02,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608352245] [2019-10-22 08:58:02,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,386 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2019-10-22 08:58:02,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32169667] [2019-10-22 08:58:02,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:02,412 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:02,642 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-22 08:58:02,725 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:02,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:02,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:02,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:02,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:02,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:02,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:02,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:02,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2019-10-22 08:58:02,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:02,726 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:02,731 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:58:02,733 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:58:02,735 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:58:02,737 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:58:02,738 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:58:02,743 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:58:02,871 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:58:02,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,874 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:58:02,875 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:58:02,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,879 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:58:02,881 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:58:02,883 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:58:03,142 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:58:03,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:03,238 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:03,239 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:58:03,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,246 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:58:03,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,248 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:58:03,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,249 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,258 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:58:03,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,261 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:58:03,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,264 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,267 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:58:03,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,268 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,283 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:58:03,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,283 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:03,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,286 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:03,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,303 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:58:03,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:03,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:03,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,306 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:03,306 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:03,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:03,307 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:58:03,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:03,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:03,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:03,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:03,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:03,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:03,366 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:03,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:03,378 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:03,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:03,380 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:03,380 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:03,380 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-10-22 08:58:03,398 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:58:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:03,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:03,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:03,451 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:58:03,451 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:58:03,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-10-22 08:58:03,473 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 55 states and 75 transitions. Complement of second has 6 states. [2019-10-22 08:58:03,475 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:58:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2019-10-22 08:58:03,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:58:03,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 08:58:03,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:58:03,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:03,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. [2019-10-22 08:58:03,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:58:03,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2019-10-22 08:58:03,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:58:03,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:58:03,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-10-22 08:58:03,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:03,480 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:58:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-10-22 08:58:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 08:58:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:58:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-10-22 08:58:03,488 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:58:03,488 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:58:03,488 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2019-10-22 08:58:03,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:58:03,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:03,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:03,489 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,489 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:03,489 INFO L791 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 453#L555 assume !(main_~length1~0 < 1); 454#L555-2 assume !(main_~length2~0 < 1); 471#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 472#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 481#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 482#L564-3 assume !(main_~i~0 < main_~length1~0); 483#L564-4 main_~i~1 := 0; 457#L568-3 assume !(main_~i~1 < main_~length2~0); 458#L568-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_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 478#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 469#L518-4 [2019-10-22 08:58:03,490 INFO L793 eck$LassoCheckResult]: Loop: 469#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 474#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 468#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 469#L518-4 [2019-10-22 08:58:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2019-10-22 08:58:03,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295610224] [2019-10-22 08:58:03,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:03,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295610224] [2019-10-22 08:58:03,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:03,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59882851] [2019-10-22 08:58:03,536 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2019-10-22 08:58:03,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024028602] [2019-10-22 08:58:03,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:03,543 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:03,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:03,568 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:58:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,589 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-10-22 08:58:03,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:03,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-10-22 08:58:03,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:58:03,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2019-10-22 08:58:03,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 08:58:03,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-10-22 08:58:03,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-10-22 08:58:03,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:03,592 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-10-22 08:58:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-10-22 08:58:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-22 08:58:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:58:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 08:58:03,594 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:58:03,594 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:58:03,594 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:03,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-10-22 08:58:03,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:58:03,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:03,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:03,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:03,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:03,596 INFO L791 eck$LassoCheckResult]: Stem: 553#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 535#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 527#L555 assume !(main_~length1~0 < 1); 528#L555-2 assume !(main_~length2~0 < 1); 546#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 547#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 555#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 556#L564-3 assume !(main_~i~0 < main_~length1~0); 557#L564-4 main_~i~1 := 0; 533#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 525#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 526#L568-3 assume !(main_~i~1 < main_~length2~0); 534#L568-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_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 552#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 543#L518-4 [2019-10-22 08:58:03,596 INFO L793 eck$LassoCheckResult]: Loop: 543#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 548#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 542#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 543#L518-4 [2019-10-22 08:58:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2019-10-22 08:58:03,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995454895] [2019-10-22 08:58:03,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:03,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995454895] [2019-10-22 08:58:03,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646943796] [2019-10-22 08:58:03,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_289f5074-d269-4fa1-877f-83e33c77c6af/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 08:58:03,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:03,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-22 08:58:03,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:03,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-10-22 08:58:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:03,903 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 08:58:03,903 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_1], 1=[v_arrayElimCell_2]} [2019-10-22 08:58:03,907 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:921) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:880) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:794) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 08:58:03,910 INFO L168 Benchmark]: Toolchain (without parser) took 4487.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 937.0 MB in the beginning and 884.7 MB in the end (delta: 52.3 MB). Peak memory consumption was 203.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:03,910 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:03,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:03,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:03,911 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 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:58:03,913 INFO L168 Benchmark]: RCFGBuilder took 421.50 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:03,913 INFO L168 Benchmark]: BuchiAutomizer took 3394.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:03,915 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 587.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.50 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3394.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 210.3 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...