./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/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 64bit --witnessprinter.graph.data.programhash e5f2fff70da48a026b1d6e0ec73c6a0ad6755ace .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:47,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:47,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:47,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:47,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:47,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:47,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:47,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:47,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:47,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:47,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:47,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:47,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:47,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:47,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:47,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:47,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:47,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:47,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:47,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:47,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:47,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:47,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:47,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:47,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:47,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:47,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:47,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:47,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:47,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:47,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:47,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:47,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:47,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:47,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:47,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:47,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:47,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:47,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:47,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:47,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:47,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:47,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:47,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:47,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:47,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:47,070 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:47,070 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:47,070 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:47,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:47,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:47,072 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:47,073 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:47,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:47,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:47,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:47,074 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:47,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:47,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:47,074 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:47,075 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:47,075 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5f2fff70da48a026b1d6e0ec73c6a0ad6755ace [2019-10-22 08:55:47,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:47,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:47,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:47,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:47,122 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:47,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i [2019-10-22 08:55:47,165 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/data/0eb3ad530/1833b1dd7087402aa47544dc50b52a8e/FLAG99be864d7 [2019-10-22 08:55:47,607 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:47,608 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i [2019-10-22 08:55:47,617 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/data/0eb3ad530/1833b1dd7087402aa47544dc50b52a8e/FLAG99be864d7 [2019-10-22 08:55:47,631 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/data/0eb3ad530/1833b1dd7087402aa47544dc50b52a8e [2019-10-22 08:55:47,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:47,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:47,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:47,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:47,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:47,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:47" (1/1) ... [2019-10-22 08:55:47,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcd7b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:47, skipping insertion in model container [2019-10-22 08:55:47,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:47" (1/1) ... [2019-10-22 08:55:47,650 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:47,686 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:48,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:48,034 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:48,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:48,134 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:48,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48 WrapperNode [2019-10-22 08:55:48,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:48,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:48,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:48,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:48,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:48,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:48,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:48,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:48,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... [2019-10-22 08:55:48,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:48,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:48,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:48,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:48,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f19178c6-055f-451c-946c-559666136256/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:48,495 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:48,495 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:48,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:48 BoogieIcfgContainer [2019-10-22 08:55:48,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:48,497 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:48,497 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:48,500 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:48,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:48,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:47" (1/3) ... [2019-10-22 08:55:48,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bcc6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:48, skipping insertion in model container [2019-10-22 08:55:48,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:48,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:48" (2/3) ... [2019-10-22 08:55:48,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bcc6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:48, skipping insertion in model container [2019-10-22 08:55:48,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:48,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:48" (3/3) ... [2019-10-22 08:55:48,511 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_mixed_alloca.i [2019-10-22 08:55:48,550 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:48,550 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:48,550 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:48,551 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:48,551 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:48,551 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:48,551 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:48,551 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:48,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:48,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:55:48,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:48,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:48,602 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:48,602 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:48,602 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:48,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:48,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:55:48,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:48,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:48,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:48,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:48,611 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 6#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2019-10-22 08:55:48,611 INFO L793 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 3#L367-1true assume !!(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-10-22 08:55:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-10-22 08:55:48,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519039672] [2019-10-22 08:55:48,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,802 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-10-22 08:55:48,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993572194] [2019-10-22 08:55:48,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-10-22 08:55:48,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:48,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640622527] [2019-10-22 08:55:48,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:48,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:48,882 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:49,294 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-10-22 08:55:49,425 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:55:49,436 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:49,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:49,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:49,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:49,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:49,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:49,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:49,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:49,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_mixed_alloca.i_Iteration1_Lasso [2019-10-22 08:55:49,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:49,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:49,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,784 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-10-22 08:55:49,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:49,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:50,105 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-22 08:55:50,474 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:55:50,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:50,617 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:50,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,621 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,622 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,622 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,628 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,629 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,653 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:50,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,663 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:50,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,670 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:50,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,728 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:50,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,732 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:55:50,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,732 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:55:50,733 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:50,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,738 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,738 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,744 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,749 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,750 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:50,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:50,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:50,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:50,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:50,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:50,764 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:50,765 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:50,851 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:50,875 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:50,876 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:55:50,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:50,879 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:50,879 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:50,880 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2019-10-22 08:55:50,912 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-10-22 08:55:50,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:50,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:50,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:50,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:51,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:51,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:55:51,087 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-10-22 08:55:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-10-22 08:55:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:55:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:55:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:55:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:51,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-10-22 08:55:51,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:51,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-10-22 08:55:51,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:55:51,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:55:51,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-10-22 08:55:51,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:51,104 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-22 08:55:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-10-22 08:55:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 08:55:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:55:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 08:55:51,127 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:55:51,127 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:55:51,127 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:51,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 08:55:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:51,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:51,129 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:51,129 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:51,129 INFO L791 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 154#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 155#L381 assume !(main_~length1~0 < 1); 164#L381-2 assume !(main_~length2~0 < 1); 170#L384-1 assume !(main_~n~0 < 1); 165#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 166#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 156#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 157#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 172#L369 assume !cstrncat_#t~short209; 168#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 171#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 161#L369 [2019-10-22 08:55:51,129 INFO L793 eck$LassoCheckResult]: Loop: 161#L369 assume !cstrncat_#t~short209; 167#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;havoc cstrncat_#t~mem208;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 160#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 161#L369 [2019-10-22 08:55:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-10-22 08:55:51,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:51,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509466255] [2019-10-22 08:55:51,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:51,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509466255] [2019-10-22 08:55:51,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:51,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:51,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288179380] [2019-10-22 08:55:51,179 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-10-22 08:55:51,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:51,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376927885] [2019-10-22 08:55:51,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:51,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:51,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376927885] [2019-10-22 08:55:51,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:51,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:51,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883471837] [2019-10-22 08:55:51,195 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:51,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:51,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:51,199 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:55:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:51,219 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-10-22 08:55:51,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:51,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-10-22 08:55:51,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:51,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-10-22 08:55:51,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:51,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:51,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:51,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:51,222 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:51,222 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:51,222 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:51,222 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:51,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:51,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:51,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:51,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:51 BoogieIcfgContainer [2019-10-22 08:55:51,231 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:51,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:51,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:51,231 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:51,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:48" (3/4) ... [2019-10-22 08:55:51,237 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:51,237 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:51,238 INFO L168 Benchmark]: Toolchain (without parser) took 3603.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.1 MB in the beginning and 943.1 MB in the end (delta: -4.0 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:51,239 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:51,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:51,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:51,242 INFO L168 Benchmark]: Boogie Preprocessor took 22.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:51,242 INFO L168 Benchmark]: RCFGBuilder took 295.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:51,243 INFO L168 Benchmark]: BuchiAutomizer took 2733.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 142.2 MB). Peak memory consumption was 142.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:51,243 INFO L168 Benchmark]: Witness Printer took 6.11 ms. Allocated memory is still 1.2 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:51,250 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.18 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 22.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2733.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 943.1 MB in the end (delta: 142.2 MB). Peak memory consumption was 142.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.11 ms. Allocated memory is still 1.2 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax100 hnf99 lsp97 ukn77 mio100 lsp51 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf181 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 10 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...