./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/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 c15bd857267d499e7ecc6e455c2b5fbe7515d7da .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:51:15,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:51:15,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:51:15,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:51:15,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:51:15,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:51:15,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:51:15,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:51:15,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:51:15,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:51:15,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:51:15,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:51:15,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:51:15,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:51:15,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:51:15,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:51:15,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:51:15,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:51:15,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:51:15,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:51:15,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:51:15,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:51:15,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:51:15,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:51:15,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:51:15,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:51:15,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:51:15,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:51:15,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:51:15,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:51:15,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:51:15,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:51:15,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:51:15,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:51:15,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:51:15,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:51:15,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:51:15,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:51:15,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:51:15,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:51:15,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:51:15,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 00:51:15,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:51:15,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:51:15,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:51:15,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:51:15,105 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:51:15,105 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 00:51:15,105 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 00:51:15,105 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 00:51:15,106 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 00:51:15,106 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 00:51:15,106 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 00:51:15,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:51:15,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:51:15,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:51:15,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:51:15,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:51:15,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:51:15,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 00:51:15,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 00:51:15,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 00:51:15,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:51:15,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:51:15,109 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 00:51:15,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:51:15,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 00:51:15,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:51:15,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:51:15,110 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 00:51:15,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:51:15,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:51:15,110 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 00:51:15,111 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 00:51:15,111 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_4357788c-7081-40b4-bff6-fe769055ca07/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 -> c15bd857267d499e7ecc6e455c2b5fbe7515d7da [2019-11-20 00:51:15,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:51:15,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:51:15,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:51:15,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:51:15,286 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:51:15,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-20 00:51:15,348 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/data/5bc00c0d7/abb31e29ba354dd69feadfaf9020d98c/FLAG017f1ec27 [2019-11-20 00:51:15,823 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:51:15,824 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2019-11-20 00:51:15,843 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/data/5bc00c0d7/abb31e29ba354dd69feadfaf9020d98c/FLAG017f1ec27 [2019-11-20 00:51:16,165 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/data/5bc00c0d7/abb31e29ba354dd69feadfaf9020d98c [2019-11-20 00:51:16,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:51:16,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:51:16,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:51:16,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:51:16,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:51:16,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aac797c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16, skipping insertion in model container [2019-11-20 00:51:16,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,192 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:51:16,241 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:51:16,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:51:16,631 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:51:16,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:51:16,756 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:51:16,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16 WrapperNode [2019-11-20 00:51:16,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:51:16,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:51:16,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:51:16,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:51:16,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:51:16,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:51:16,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:51:16,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:51:16,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... [2019-11-20 00:51:16,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:51:16,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:51:16,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:51:16,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:51:16,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/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-20 00:51:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:51:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:51:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:51:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:51:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:51:16,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:51:17,352 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:51:17,353 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-20 00:51:17,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:51:17 BoogieIcfgContainer [2019-11-20 00:51:17,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:51:17,354 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 00:51:17,355 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 00:51:17,358 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 00:51:17,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:51:17,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 12:51:16" (1/3) ... [2019-11-20 00:51:17,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b681303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:51:17, skipping insertion in model container [2019-11-20 00:51:17,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:51:17,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:51:16" (2/3) ... [2019-11-20 00:51:17,361 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b681303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:51:17, skipping insertion in model container [2019-11-20 00:51:17,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 00:51:17,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:51:17" (3/3) ... [2019-11-20 00:51:17,363 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2019-11-20 00:51:17,407 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 00:51:17,407 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 00:51:17,407 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 00:51:17,407 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:51:17,407 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:51:17,408 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 00:51:17,408 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:51:17,408 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 00:51:17,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-20 00:51:17,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 00:51:17,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:17,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:17,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 00:51:17,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:17,446 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 00:51:17,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-20 00:51:17,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-20 00:51:17,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:17,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:17,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 00:51:17,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:17,456 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 23#L527true assume !(main_~length1~0 < 1); 7#L527-2true assume !(main_~length2~0 < 2); 19#L530-1true assume !(main_~length3~0 < 1); 11#L533-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5#L540-3true [2019-11-20 00:51:17,457 INFO L796 eck$LassoCheckResult]: Loop: 5#L540-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 22#L540-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5#L540-3true [2019-11-20 00:51:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-11-20 00:51:17,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:17,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820343781] [2019-11-20 00:51:17,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,588 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2019-11-20 00:51:17,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:17,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659310847] [2019-11-20 00:51:17,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:17,611 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2019-11-20 00:51:17,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:17,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256178382] [2019-11-20 00:51:17,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:17,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:18,013 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-20 00:51:18,135 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:51:18,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:51:18,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:51:18,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:51:18,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:51:18,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:51:18,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:51:18,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2019-11-20 00:51:18,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:51:18,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:51:18,172 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-20 00:51:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:18,180 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-20 00:51:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:18,191 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-20 00:51:18,194 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-20 00:51:18,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:18,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:18,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:18,210 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-20 00:51:18,357 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-20 00:51:18,389 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-20 00:51:18,392 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-20 00:51:18,394 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-20 00:51:18,398 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-20 00:51:18,401 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-20 00:51:18,403 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-20 00:51:18,407 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-20 00:51:18,771 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:51:18,777 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,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-20 00:51:18,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,805 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-20 00:51:18,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,830 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-20 00:51:18,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,854 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-20 00:51:18,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:18,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:18,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,882 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-20 00:51:18,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:18,903 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-20 00:51:18,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:18,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:18,926 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 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,939 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-20 00:51:18,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:18,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:18,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:18,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:18,962 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-20 00:51:18,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:18,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:18,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:18,986 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-20 00:51:18,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:18,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:18,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:18,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:18,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:18,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,017 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-20 00:51:19,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:19,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:19,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:19,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,030 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-20 00:51:19,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:19,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:19,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:19,053 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-20 00:51:19,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:19,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,076 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-20 00:51:19,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:19,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:19,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:19,099 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-20 00:51:19,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:19,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:19,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:19,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,126 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-20 00:51:19,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:19,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:19,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:19,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:19,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:19,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:19,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:51:19,296 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 00:51:19,296 INFO L444 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:19,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:19,313 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:51:19,314 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:51:19,314 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-20 00:51:19,334 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-20 00:51:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:19,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:51:19,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:19,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:51:19,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:19,407 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-20 00:51:19,422 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-20 00:51:19,423 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-20 00:51:19,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 52 states and 74 transitions. Complement of second has 7 states. [2019-11-20 00:51:19,484 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-20 00:51:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 00:51:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2019-11-20 00:51:19,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-20 00:51:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-20 00:51:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-20 00:51:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:19,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2019-11-20 00:51:19,495 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 00:51:19,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2019-11-20 00:51:19,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 00:51:19,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-20 00:51:19,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-20 00:51:19,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:19,504 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-20 00:51:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-20 00:51:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-20 00:51:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 00:51:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-20 00:51:19,538 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-20 00:51:19,538 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-20 00:51:19,538 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 00:51:19,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-20 00:51:19,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 00:51:19,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:19,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:19,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:19,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:19,542 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 160#L527 assume !(main_~length1~0 < 1); 156#L527-2 assume !(main_~length2~0 < 2); 157#L530-1 assume !(main_~length3~0 < 1); 161#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 151#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 153#L540-4 main_~i~1 := 0; 155#L545-3 [2019-11-20 00:51:19,543 INFO L796 eck$LassoCheckResult]: Loop: 155#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 158#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 155#L545-3 [2019-11-20 00:51:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2019-11-20 00:51:19,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:19,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632198175] [2019-11-20 00:51:19,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2019-11-20 00:51:19,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:19,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674655175] [2019-11-20 00:51:19,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2019-11-20 00:51:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:19,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004811248] [2019-11-20 00:51:19,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:19,681 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:19,970 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-20 00:51:20,064 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:51:20,064 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:51:20,064 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:51:20,064 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:51:20,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:51:20,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:20,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:51:20,065 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:51:20,065 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2019-11-20 00:51:20,065 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:51:20,065 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:51:20,068 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-20 00:51:20,071 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-20 00:51:20,224 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-20 00:51:20,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:20,253 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-20 00:51:20,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:20,261 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-20 00:51:20,264 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-20 00:51:20,271 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-20 00:51:20,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 00:51:20,282 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-20 00:51:20,285 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-20 00:51:20,289 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-20 00:51:20,292 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-20 00:51:20,295 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-20 00:51:20,297 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-20 00:51:20,300 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-20 00:51:20,436 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-20 00:51:20,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:51:20,715 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:20,730 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-20 00:51:20,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:20,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:20,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:20,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:20,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:20,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:20,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:20,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:20,765 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-20 00:51:20,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:20,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:20,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:20,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:20,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:20,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:20,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:20,785 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-20 00:51:20,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:20,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:20,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:20,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:20,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:20,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:20,810 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:51:20,845 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-20 00:51:20,845 INFO L444 ModelExtractionUtils]: 18 out of 34 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:20,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 00:51:20,851 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 00:51:20,851 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:51:20,851 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~length2~0 >= 0] [2019-11-20 00:51:20,878 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 00:51:20,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 00:51:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:20,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:51:20,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:20,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:20,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-20 00:51:20,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:21,002 INFO L567 ElimStorePlain]: treesize reduction 10, result has 61.5 percent of original size [2019-11-20 00:51:21,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:21,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2019-11-20 00:51:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:21,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:51:21,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:21,052 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-20 00:51:21,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 00:51:21,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-20 00:51:21,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 24 states and 36 transitions. Complement of second has 7 states. [2019-11-20 00:51:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 00:51:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:51:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-20 00:51:21,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-20 00:51:21,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:21,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-20 00:51:21,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:21,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-20 00:51:21,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:21,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. [2019-11-20 00:51:21,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 00:51:21,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2019-11-20 00:51:21,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 00:51:21,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 00:51:21,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-20 00:51:21,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:21,127 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-20 00:51:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-20 00:51:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-20 00:51:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 00:51:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-20 00:51:21,129 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-20 00:51:21,129 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-20 00:51:21,129 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 00:51:21,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-20 00:51:21,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 00:51:21,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:21,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:21,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:21,131 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:21,131 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 290#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 291#L527 assume !(main_~length1~0 < 1); 286#L527-2 assume !(main_~length2~0 < 2); 287#L530-1 assume !(main_~length3~0 < 1); 292#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 281#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 283#L540-4 main_~i~1 := 0; 285#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 293#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 280#L517-3 [2019-11-20 00:51:21,132 INFO L796 eck$LassoCheckResult]: Loop: 280#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 278#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 280#L517-3 [2019-11-20 00:51:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2019-11-20 00:51:21,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:21,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104148005] [2019-11-20 00:51:21,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:21,226 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-20 00:51:21,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104148005] [2019-11-20 00:51:21,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:51:21,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:51:21,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565786182] [2019-11-20 00:51:21,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 00:51:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2019-11-20 00:51:21,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:21,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633562226] [2019-11-20 00:51:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,246 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:21,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:51:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:51:21,285 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-20 00:51:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:21,313 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-20 00:51:21,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:51:21,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-20 00:51:21,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 00:51:21,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2019-11-20 00:51:21,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-20 00:51:21,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-20 00:51:21,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-20 00:51:21,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:21,317 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-20 00:51:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-20 00:51:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-20 00:51:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 00:51:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-20 00:51:21,321 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-20 00:51:21,321 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-20 00:51:21,321 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 00:51:21,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-20 00:51:21,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 00:51:21,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:21,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:21,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:21,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:21,323 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 334#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 335#L527 assume !(main_~length1~0 < 1); 330#L527-2 assume !(main_~length2~0 < 2); 331#L530-1 assume !(main_~length3~0 < 1); 336#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 325#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 327#L540-4 main_~i~1 := 0; 329#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 332#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 333#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 337#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 324#L517-3 [2019-11-20 00:51:21,324 INFO L796 eck$LassoCheckResult]: Loop: 324#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 322#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 324#L517-3 [2019-11-20 00:51:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2019-11-20 00:51:21,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:21,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766248912] [2019-11-20 00:51:21,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2019-11-20 00:51:21,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:21,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978521992] [2019-11-20 00:51:21,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:21,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2019-11-20 00:51:21,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:21,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263323901] [2019-11-20 00:51:21,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:21,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263323901] [2019-11-20 00:51:21,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912216280] [2019-11-20 00:51:21,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:51:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:21,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 00:51:21,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:21,866 INFO L343 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-20 00:51:21,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-20 00:51:21,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:21,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:21,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 00:51:21,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2019-11-20 00:51:21,922 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 00:51:21,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:21,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2019-11-20 00:51:21,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:21,965 INFO L567 ElimStorePlain]: treesize reduction 33, result has 42.1 percent of original size [2019-11-20 00:51:21,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:21,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:48, output treesize:3 [2019-11-20 00:51:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:51:21,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:51:21,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-20 00:51:21,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11398343] [2019-11-20 00:51:21,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 00:51:21,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-20 00:51:21,995 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-11-20 00:51:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:22,478 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-11-20 00:51:22,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:51:22,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-20 00:51:22,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 00:51:22,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2019-11-20 00:51:22,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 00:51:22,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-20 00:51:22,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-20 00:51:22,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:22,481 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-20 00:51:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-20 00:51:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-20 00:51:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 00:51:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-20 00:51:22,483 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 00:51:22,483 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-20 00:51:22,484 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 00:51:22,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-20 00:51:22,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-20 00:51:22,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:22,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:22,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:22,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:22,485 INFO L794 eck$LassoCheckResult]: Stem: 456#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 451#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 452#L527 assume !(main_~length1~0 < 1); 445#L527-2 assume !(main_~length2~0 < 2); 446#L530-1 assume !(main_~length3~0 < 1); 453#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 440#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 442#L540-4 main_~i~1 := 0; 444#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 449#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 450#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 454#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 459#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 438#L517-1 assume !(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2; 439#L519-2 [2019-11-20 00:51:22,486 INFO L796 eck$LassoCheckResult]: Loop: 439#L519-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 458#L519 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; 439#L519-2 [2019-11-20 00:51:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2019-11-20 00:51:22,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619615476] [2019-11-20 00:51:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2019-11-20 00:51:22,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688230564] [2019-11-20 00:51:22,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2019-11-20 00:51:22,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466446294] [2019-11-20 00:51:22,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 00:51:22,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466446294] [2019-11-20 00:51:22,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:51:22,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 00:51:22,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001507599] [2019-11-20 00:51:22,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:51:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:51:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:51:22,841 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-20 00:51:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:22,899 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-11-20 00:51:22,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:51:22,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-11-20 00:51:22,901 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 00:51:22,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2019-11-20 00:51:22,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-20 00:51:22,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-20 00:51:22,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-11-20 00:51:22,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:22,902 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-20 00:51:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-11-20 00:51:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-20 00:51:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 00:51:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-20 00:51:22,905 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-20 00:51:22,905 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-20 00:51:22,905 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 00:51:22,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-20 00:51:22,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-20 00:51:22,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 00:51:22,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 00:51:22,907 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:51:22,907 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 00:51:22,907 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 529#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 530#L527 assume !(main_~length1~0 < 1); 523#L527-2 assume !(main_~length2~0 < 2); 524#L530-1 assume !(main_~length3~0 < 1); 531#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 517#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 519#L540-4 main_~i~1 := 0; 522#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 543#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 542#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 541#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 540#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 539#L545-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 516#L517-3 [2019-11-20 00:51:22,907 INFO L796 eck$LassoCheckResult]: Loop: 516#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 515#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 516#L517-3 [2019-11-20 00:51:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2019-11-20 00:51:22,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14605629] [2019-11-20 00:51:22,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2019-11-20 00:51:22,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652542156] [2019-11-20 00:51:22,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,937 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:22,937 INFO L82 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2019-11-20 00:51:22,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:51:22,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621602644] [2019-11-20 00:51:22,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:51:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:51:22,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:51:23,477 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2019-11-20 00:51:23,652 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-20 00:51:23,666 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 00:51:23,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 00:51:23,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 00:51:23,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 00:51:23,666 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 00:51:23,666 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:23,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 00:51:23,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 00:51:23,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2019-11-20 00:51:23,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 00:51:23,667 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 00:51:23,670 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-20 00:51:23,682 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-20 00:51:24,016 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-20 00:51:24,087 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-20 00:51:24,102 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-20 00:51:24,104 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-20 00:51:24,106 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-20 00:51:24,107 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-20 00:51:24,109 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-20 00:51:24,114 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-20 00:51:24,118 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-20 00:51:24,120 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-20 00:51:24,121 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-20 00:51:24,123 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-20 00:51:24,124 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-20 00:51:24,126 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-20 00:51:24,128 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-20 00:51:24,129 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-20 00:51:24,132 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-20 00:51:24,134 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-20 00:51:24,136 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-20 00:51:24,138 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-20 00:51:24,140 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-20 00:51:24,142 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-20 00:51:24,145 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-20 00:51:24,147 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-20 00:51:24,148 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-20 00:51:24,150 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-20 00:51:24,318 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 00:51:24,630 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 00:51:24,630 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:24,637 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-20 00:51:24,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:24,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 00:51:24,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:24,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:24,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:24,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 00:51:24,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 00:51:24,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:24,645 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-20 00:51:24,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:24,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:24,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:24,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:24,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:24,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 00:51:24,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:24,661 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-20 00:51:24,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:24,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:24,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:24,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:24,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:24,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:24,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:24,678 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-20 00:51:24,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 00:51:24,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 00:51:24,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 00:51:24,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 00:51:24,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 00:51:24,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:24,714 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 00:51:24,777 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 00:51:24,777 INFO L444 ModelExtractionUtils]: 37 out of 55 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4357788c-7081-40b4-bff6-fe769055ca07/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 00:51:24,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 00:51:24,786 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 00:51:24,786 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 00:51:24,786 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2019-11-20 00:51:24,823 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-20 00:51:24,824 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 00:51:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:24,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:51:24,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:24,878 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:51:24,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:24,890 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-20 00:51:24,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-20 00:51:24,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-20 00:51:24,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 40 states and 52 transitions. Complement of second has 7 states. [2019-11-20 00:51:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 00:51:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 00:51:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-20 00:51:24,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-20 00:51:24,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:24,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-20 00:51:24,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:24,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-20 00:51:24,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 00:51:24,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2019-11-20 00:51:24,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 00:51:24,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 00:51:24,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 00:51:24,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 00:51:24,928 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 00:51:24,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:51:24,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 00:51:24,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 00:51:24,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 12:51:24 BoogieIcfgContainer [2019-11-20 00:51:24,933 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 00:51:24,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:51:24,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:51:24,934 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:51:24,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:51:17" (3/4) ... [2019-11-20 00:51:24,937 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:51:24,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:51:24,939 INFO L168 Benchmark]: Toolchain (without parser) took 8769.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 946.1 MB in the beginning and 987.9 MB in the end (delta: -41.7 MB). Peak memory consumption was 166.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:51:24,939 INFO L168 Benchmark]: CDTParser took 0.45 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-20 00:51:24,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:51:24,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.69 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-20 00:51:24,941 INFO L168 Benchmark]: Boogie Preprocessor took 59.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:51:24,941 INFO L168 Benchmark]: RCFGBuilder took 480.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:51:24,942 INFO L168 Benchmark]: BuchiAutomizer took 7578.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 127.8 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:51:24,942 INFO L168 Benchmark]: Witness Printer took 4.05 ms. Allocated memory is still 1.2 GB. Free memory is still 987.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:51:24,945 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.45 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 583.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 480.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7578.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 127.8 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.05 ms. Allocated memory is still 1.2 GB. Free memory is still 987.9 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 - 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 6 terminating modules (3 trivial, 3 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[nondetString2] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 173 SDslu, 187 SDs, 0 SdLazy, 202 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax111 hnf98 lsp83 ukn74 mio100 lsp60 div100 bol100 ite100 ukn100 eq165 hnf91 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms 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...