./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/strreplace-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/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/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 50bdaf600d03af0a677a59daf6a875dbe69c10b2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:40:31,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:40:31,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:40:31,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:40:31,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:40:31,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:40:31,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:40:31,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:40:31,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:40:31,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:40:31,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:40:31,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:40:31,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:40:31,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:40:31,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:40:31,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:40:31,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:40:31,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:40:31,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:40:31,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:40:31,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:40:31,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:40:31,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:40:31,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:40:31,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:40:31,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:40:31,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:40:31,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:40:31,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:40:31,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:40:31,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:40:31,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:40:31,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:40:31,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:40:31,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:40:31,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:40:31,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:40:31,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:40:31,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:40:31,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:40:31,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:40:31,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:40:31,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:40:31,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:40:31,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:40:31,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:40:31,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:40:31,438 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:40:31,438 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:40:31,438 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:40:31,438 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:40:31,439 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:40:31,439 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:40:31,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:40:31,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:40:31,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:40:31,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:40:31,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:40:31,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:40:31,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:40:31,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:40:31,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:40:31,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:40:31,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:40:31,452 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:40:31,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:40:31,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:40:31,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:40:31,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:40:31,453 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:40:31,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:40:31,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:40:31,453 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:40:31,454 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:40:31,455 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/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/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 -> 50bdaf600d03af0a677a59daf6a875dbe69c10b2 [2019-11-15 20:40:31,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:40:31,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:40:31,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:40:31,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:40:31,511 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:40:31,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2019-11-15 20:40:31,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/data/f0a26b70e/b8307b3afa6d4f92983a24874e55c5d0/FLAGe89bde1d2 [2019-11-15 20:40:32,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:40:32,079 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2019-11-15 20:40:32,092 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/data/f0a26b70e/b8307b3afa6d4f92983a24874e55c5d0/FLAGe89bde1d2 [2019-11-15 20:40:32,417 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/bin/uautomizer/data/f0a26b70e/b8307b3afa6d4f92983a24874e55c5d0 [2019-11-15 20:40:32,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:40:32,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:40:32,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:40:32,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:40:32,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:40:32,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:32,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd4bdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32, skipping insertion in model container [2019-11-15 20:40:32,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:32,440 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:40:32,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:40:32,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:40:32,864 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:40:32,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:40:32,974 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:40:32,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32 WrapperNode [2019-11-15 20:40:32,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:40:32,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:40:32,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:40:32,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:40:32,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:40:33,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:40:33,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:40:33,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:40:33,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... [2019-11-15 20:40:33,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:40:33,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:40:33,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:40:33,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:40:33,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b7a31e-db9e-49e7-819c-8ab2fb0c0cc8/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-11-15 20:40:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:40:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:40:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:40:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:40:33,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:40:33,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:40:33,471 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:40:33,471 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:40:33,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:33 BoogieIcfgContainer [2019-11-15 20:40:33,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:40:33,473 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:40:33,473 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:40:33,476 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:40:33,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:33,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:40:32" (1/3) ... [2019-11-15 20:40:33,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fea6f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:40:33, skipping insertion in model container [2019-11-15 20:40:33,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:33,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:32" (2/3) ... [2019-11-15 20:40:33,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fea6f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:40:33, skipping insertion in model container [2019-11-15 20:40:33,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:33,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:33" (3/3) ... [2019-11-15 20:40:33,481 INFO L371 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca-2.i [2019-11-15 20:40:33,529 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:40:33,529 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:40:33,529 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:40:33,529 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:40:33,529 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:40:33,530 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:40:33,530 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:40:33,530 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:40:33,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:40:33,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:40:33,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:33,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:33,575 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:40:33,575 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:40:33,575 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:40:33,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 20:40:33,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 20:40:33,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:33,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:33,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:40:33,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:40:33,585 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 17#L528true assume !(main_~length1~0 < 1); 5#L528-2true call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 12#L533-3true [2019-11-15 20:40:33,585 INFO L793 eck$LassoCheckResult]: Loop: 12#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 11#L533-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 12#L533-3true [2019-11-15 20:40:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 20:40:33,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:33,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063560260] [2019-11-15 20:40:33,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,728 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 20:40:33,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:33,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177428460] [2019-11-15 20:40:33,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:33,779 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 20:40:33,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:33,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937236655] [2019-11-15 20:40:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:33,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:34,065 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:34,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:34,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:34,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:34,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:40:34,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:34,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:34,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:34,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration1_Lasso [2019-11-15 20:40:34,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:34,068 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:34,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:34,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-11-15 20:40:34,681 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:34,686 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:40:34,688 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-11-15 20:40:34,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,691 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,711 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-11-15 20:40:34,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,716 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-11-15 20:40:34,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,725 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-11-15 20:40:34,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,726 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,727 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,728 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-11-15 20:40:34,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,731 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-11-15 20:40:34,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,739 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-11-15 20:40:34,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,740 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,749 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,753 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-11-15 20:40:34,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,763 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-11-15 20:40:34,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,771 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-11-15 20:40:34,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:34,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:34,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:34,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,775 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-11-15 20:40:34,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,778 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,778 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:34,784 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-11-15 20:40:34,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:34,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:34,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:34,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:34,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:34,791 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:34,837 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:40:34,872 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:40:34,872 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:40:34,874 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:40:34,876 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:40:34,876 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:40:34,877 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-11-15 20:40:34,905 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:40:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:34,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:40:34,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:34,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:40:34,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:40:35,004 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-11-15 20:40:35,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 20:40:35,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 51 transitions. Complement of second has 7 states. [2019-11-15 20:40:35,064 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-11-15 20:40:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:40:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-15 20:40:35,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 20:40:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:35,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 20:40:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:35,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 20:40:35,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:35,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 51 transitions. [2019-11-15 20:40:35,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:40:35,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-11-15 20:40:35,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 20:40:35,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:40:35,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 20:40:35,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:35,087 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:40:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 20:40:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 20:40:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:40:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 20:40:35,117 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:40:35,118 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 20:40:35,118 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:40:35,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 20:40:35,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:40:35,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:35,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:35,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:40:35,119 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:40:35,120 INFO L791 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 116#L528 assume !(main_~length1~0 < 1); 117#L528-2 call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 118#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 122#L533-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 112#L517-3 [2019-11-15 20:40:35,120 INFO L793 eck$LassoCheckResult]: Loop: 112#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 113#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 114#L518 assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 111#L518-2 cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 112#L517-3 [2019-11-15 20:40:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 20:40:35,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142327732] [2019-11-15 20:40:35,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 1 times [2019-11-15 20:40:35,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480026042] [2019-11-15 20:40:35,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1952978730, now seen corresponding path program 1 times [2019-11-15 20:40:35,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702610989] [2019-11-15 20:40:35,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:40:35,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702610989] [2019-11-15 20:40:35,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:35,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:40:35,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455389408] [2019-11-15 20:40:35,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:40:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:40:35,436 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-15 20:40:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:35,572 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-15 20:40:35,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:40:35,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-15 20:40:35,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:40:35,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2019-11-15 20:40:35,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:40:35,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:40:35,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-11-15 20:40:35,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:35,576 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-15 20:40:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-11-15 20:40:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 20:40:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 20:40:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-15 20:40:35,578 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:40:35,578 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-15 20:40:35,578 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:40:35,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-15 20:40:35,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:40:35,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:35,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:35,580 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:35,580 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:40:35,580 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 156#L528 assume !(main_~length1~0 < 1); 161#L528-2 call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 162#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet9, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet9; 164#L533-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 165#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 166#L533-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet10 % 256 <= 127 then main_#t~nondet10 % 256 else main_#t~nondet10 % 256 - 256), (if main_#t~nondet11 % 256 <= 127 then main_#t~nondet11 % 256 else main_#t~nondet11 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 160#L517-3 [2019-11-15 20:40:35,580 INFO L793 eck$LassoCheckResult]: Loop: 160#L517-3 call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 157#L517-1 assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 158#L518 assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 159#L518-2 cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 160#L517-3 [2019-11-15 20:40:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-15 20:40:35,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394929607] [2019-11-15 20:40:35,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 2 times [2019-11-15 20:40:35,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819096219] [2019-11-15 20:40:35,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,675 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -357903304, now seen corresponding path program 1 times [2019-11-15 20:40:35,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:35,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986219911] [2019-11-15 20:40:35,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:35,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:35,761 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:36,187 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-11-15 20:40:36,781 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 20:40:36,790 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:36,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:36,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:36,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:36,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:40:36,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:36,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:36,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:36,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration3_Lasso [2019-11-15 20:40:36,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:36,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:36,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:36,874 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-15 20:40:37,679 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-15 20:40:37,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-11-15 20:40:37,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:37,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:37,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:37,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:38,467 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:38,467 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:40:38,468 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-11-15 20:40:38,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,470 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-11-15 20:40:38,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,473 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-11-15 20:40:38,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,474 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,475 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-11-15 20:40:38,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,477 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:38,477 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:38,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,479 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-11-15 20:40:38,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:38,488 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:38,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,491 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-11-15 20:40:38,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,492 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,492 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,493 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,494 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-11-15 20:40:38,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,494 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,495 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,496 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-11-15 20:40:38,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,498 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:38,498 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:38,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,500 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-11-15 20:40:38,509 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,512 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-11-15 20:40:38,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,514 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,517 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-11-15 20:40:38,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:38,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:38,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:38,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,521 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-11-15 20:40:38,521 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,521 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,522 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,522 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:38,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:38,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:38,525 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-11-15 20:40:38,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:38,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:38,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:38,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:38,531 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:38,531 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:38,591 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:40:38,645 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 20:40:38,646 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 20:40:38,646 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:40:38,647 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:40:38,648 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:40:38,648 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrreplace_~p~0.base)_1, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrreplace_~p~0.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2019-11-15 20:40:38,674 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 20:40:38,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:40:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:38,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:40:38,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:38,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:40:38,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:40:38,743 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-11-15 20:40:38,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:40:38,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 16 states and 21 transitions. Complement of second has 4 states. [2019-11-15 20:40:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:40:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:40:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 20:40:38,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 20:40:38,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:38,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 20:40:38,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:38,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-15 20:40:38,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:38,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-11-15 20:40:38,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:40:38,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-15 20:40:38,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:40:38,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:40:38,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:40:38,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:38,774 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:38,774 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:38,774 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:38,774 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:40:38,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:40:38,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:40:38,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:40:38,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:40:38 BoogieIcfgContainer [2019-11-15 20:40:38,783 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:40:38,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:40:38,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:40:38,785 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:40:38,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:33" (3/4) ... [2019-11-15 20:40:38,790 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:40:38,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:40:38,792 INFO L168 Benchmark]: Toolchain (without parser) took 6370.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 944.7 MB in the beginning and 831.4 MB in the end (delta: 113.3 MB). Peak memory consumption was 328.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:38,793 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:38,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:38,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.28 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:38,796 INFO L168 Benchmark]: Boogie Preprocessor took 31.05 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-11-15 20:40:38,796 INFO L168 Benchmark]: RCFGBuilder took 417.82 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:38,798 INFO L168 Benchmark]: BuchiAutomizer took 5310.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 831.4 MB in the end (delta: 263.4 MB). Peak memory consumption was 339.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:38,799 INFO L168 Benchmark]: Witness Printer took 5.97 ms. Allocated memory is still 1.2 GB. Free memory is still 831.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:38,808 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.28 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.05 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 417.82 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5310.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 831.4 MB in the end (delta: 263.4 MB). Peak memory consumption was 339.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.97 ms. Allocated memory is still 1.2 GB. Free memory is still 831.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 52 SDslu, 39 SDs, 0 SdLazy, 47 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital339 mio100 ax111 hnf98 lsp59 ukn130 mio100 lsp37 div114 bol100 ite100 ukn100 eq163 hnf84 smp97 dnf141 smp77 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...