./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat.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_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/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 169307d87ddc37871e07877236048b02359797e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:17,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:17,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:17,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:17,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:17,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:17,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:17,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:17,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:17,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:17,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:17,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:17,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:17,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:17,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:17,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:17,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:17,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:17,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:17,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:17,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:17,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:17,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:17,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:17,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:17,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:17,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:17,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:17,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:17,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:17,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:17,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:17,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:17,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:17,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:17,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:17,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:17,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:17,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:17,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:17,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:17,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:17,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:17,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:17,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:17,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:17,696 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:17,696 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:17,696 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:17,696 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:17,696 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:17,697 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:17,697 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:17,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:17,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:17,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:17,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:17,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:17,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:17,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:17,699 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:17,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:17,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:17,699 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:17,700 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:17,700 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_a7c941ec-9047-4adb-ad45-11c153709027/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 -> 169307d87ddc37871e07877236048b02359797e9 [2019-10-22 08:54:17,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:17,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:17,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:17,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:17,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:17,748 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat.i [2019-10-22 08:54:17,793 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/data/eb81e8f1e/bc6028b672b34158a7097fde262fd648/FLAGf929ad95d [2019-10-22 08:54:18,196 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:18,196 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/sv-benchmarks/c/termination-libowfat/strcat.i [2019-10-22 08:54:18,207 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/data/eb81e8f1e/bc6028b672b34158a7097fde262fd648/FLAGf929ad95d [2019-10-22 08:54:18,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/bin/uautomizer/data/eb81e8f1e/bc6028b672b34158a7097fde262fd648 [2019-10-22 08:54:18,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:18,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:18,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:18,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:18,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:18,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b5c6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18, skipping insertion in model container [2019-10-22 08:54:18,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:18,269 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:18,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:18,567 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:18,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:18,674 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:18,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18 WrapperNode [2019-10-22 08:54:18,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:18,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:18,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:18,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:18,683 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:54:18" (1/1) ... [2019-10-22 08:54:18,697 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:54:18" (1/1) ... [2019-10-22 08:54:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:18,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:18,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:18,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:18,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... [2019-10-22 08:54:18,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:18,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:18,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:18,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:18,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a7c941ec-9047-4adb-ad45-11c153709027/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:54:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:18,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:19,243 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:19,244 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:54:19,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:19 BoogieIcfgContainer [2019-10-22 08:54:19,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:19,245 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:19,245 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:19,250 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:19,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:19,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:18" (1/3) ... [2019-10-22 08:54:19,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19926484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:19, skipping insertion in model container [2019-10-22 08:54:19,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:19,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:18" (2/3) ... [2019-10-22 08:54:19,253 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19926484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:19, skipping insertion in model container [2019-10-22 08:54:19,253 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:19,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:19" (3/3) ... [2019-10-22 08:54:19,254 INFO L371 chiAutomizerObserver]: Analyzing ICFG strcat.i [2019-10-22 08:54:19,301 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:19,301 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:19,301 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:19,302 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:19,303 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:19,303 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:19,303 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:19,303 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:19,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:54:19,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:54:19,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:19,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:19,347 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:19,347 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:19,347 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:19,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:54:19,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:54:19,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:19,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:19,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:19,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:19,357 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 4#L526true assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 15#L530true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 11#L532true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 18#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2019-10-22 08:54:19,357 INFO L793 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 19#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 23#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2019-10-22 08:54:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-10-22 08:54:19,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23959252] [2019-10-22 08:54:19,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,535 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2019-10-22 08:54:19,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74830013] [2019-10-22 08:54:19,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2019-10-22 08:54:19,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:19,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398658674] [2019-10-22 08:54:19,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:19,615 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:20,086 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-10-22 08:54:20,240 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:54:20,251 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:20,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:20,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:20,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:20,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:20,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:20,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:20,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:20,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat.i_Iteration1_Lasso [2019-10-22 08:54:20,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:20,254 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:20,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:20,296 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:54:20,298 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:54: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-10-22 08:54:20,302 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:54:20,304 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:54:20,310 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:54:20,312 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:54:20,315 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:54:20,322 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:54:20,324 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:54:20,326 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:54:20,329 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:54:20,331 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:54:20,336 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:54:20,340 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:54:20,342 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:54:20,345 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:54:20,347 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:54:20,349 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:54:20,352 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:54:20,354 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:54:20,356 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:54:20,359 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:54:20,361 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:54:20,364 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:54:20,366 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:54:20,368 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:54:20,792 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-10-22 08:54:20,850 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:54:20,852 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:54:20,854 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:54:20,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:54:20,858 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:54:20,860 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:54:20,862 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:54:20,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:54:20,866 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:54:20,868 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:54:21,663 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:54:21,794 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:21,798 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:21,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-10-22 08:54:21,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,811 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:54:21,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,812 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,812 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,813 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:54:21,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,814 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,814 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,814 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,814 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,815 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:54:21,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,823 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,823 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,823 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:54:21,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,824 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,826 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:54:21,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,830 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,842 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:54:21,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,845 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:54:21,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,847 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:54:21,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,850 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,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-10-22 08:54:21,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,855 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,856 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:54:21,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,858 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,859 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:54:21,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,867 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:54:21,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,870 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:54:21,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,875 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,875 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,876 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:54:21,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,879 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:54:21,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,885 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:54:21,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,889 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:54:21,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,891 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:54:21,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,894 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:54:21,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,897 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:54:21,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,900 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:54:21,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,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-10-22 08:54:21,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,905 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,905 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,909 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:54:21,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,912 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:54:21,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,913 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,915 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:54:21,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,915 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,918 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:54:21,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:21,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:21,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:21,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,921 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:54:21,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,923 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,923 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,928 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:54:21,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,930 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,930 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,934 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:54:21,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,935 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:21,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,943 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:21,943 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,995 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:54:21,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,998 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,999 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,009 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:54:22,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,011 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,011 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,015 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:54:22,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:22,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:22,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,020 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:54:22,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,021 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:54:22,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:22,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:22,024 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:54:22,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:22,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:22,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:22,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:22,030 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:22,030 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:22,098 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:22,139 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:22,148 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:22,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:22,151 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:22,151 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:22,153 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 Supporting invariants [] [2019-10-22 08:54:22,182 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:54:22,190 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:22,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:22,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:22,252 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:54:22,266 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:54:22,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-10-22 08:54:22,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 5 states. [2019-10-22 08:54:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2019-10-22 08:54:22,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:54:22,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:54:22,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:54:22,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:22,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. [2019-10-22 08:54:22,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-10-22 08:54:22,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 24 states and 27 transitions. [2019-10-22 08:54:22,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:54:22,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 08:54:22,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-10-22 08:54:22,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:22,332 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-22 08:54:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-10-22 08:54:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-10-22 08:54:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-22 08:54:22,356 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:54:22,356 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-22 08:54:22,357 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:22,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-10-22 08:54:22,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:22,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:22,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:22,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:22,358 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:22,358 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 172#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 173#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 179#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 180#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 175#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 176#L516-2 [2019-10-22 08:54:22,358 INFO L793 eck$LassoCheckResult]: Loop: 176#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 177#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 185#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 183#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 182#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 176#L516-2 [2019-10-22 08:54:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2019-10-22 08:54:22,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:22,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083666943] [2019-10-22 08:54:22,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:22,432 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:54:22,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083666943] [2019-10-22 08:54:22,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:22,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:22,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821883473] [2019-10-22 08:54:22,435 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 1 times [2019-10-22 08:54:22,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:22,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229734314] [2019-10-22 08:54:22,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:22,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:22,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:22,972 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-10-22 08:54:23,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:23,055 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-10-22 08:54:23,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:23,076 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-10-22 08:54:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:23,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-10-22 08:54:23,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:23,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2019-10-22 08:54:23,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:54:23,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:54:23,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2019-10-22 08:54:23,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:23,080 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:54:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2019-10-22 08:54:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:54:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-22 08:54:23,082 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:54:23,082 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-22 08:54:23,082 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:23,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-10-22 08:54:23,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:23,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:23,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:23,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:23,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:23,084 INFO L791 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 223#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~malloc19.base, main_#t~malloc19.offset, main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet18;havoc main_#t~nondet18; 217#L526 assume !(main_~in_len~0 < 1);call main_#t~malloc19.base, main_#t~malloc19.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc19.base, main_#t~malloc19.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 218#L530 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet21;havoc main_#t~nondet21; 224#L532 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_#t~mem9, strcat_#t~pre10.base, strcat_#t~pre10.offset, strcat_#t~pre11.base, strcat_#t~pre11.offset, strcat_#t~mem12, strcat_#t~pre13.base, strcat_#t~pre13.offset, strcat_#t~pre14.base, strcat_#t~pre14.offset, strcat_#t~mem15, strcat_#t~pre16.base, strcat_#t~pre16.offset, strcat_#t~pre17.base, strcat_#t~pre17.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 225#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 213#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 215#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 219#L509-5 strlen_#res := strlen_~i~0; 220#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 221#L516-2 [2019-10-22 08:54:23,084 INFO L793 eck$LassoCheckResult]: Loop: 221#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 222#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset;call strcat_#t~mem9 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem9, strcat_~s.base, strcat_~s.offset, 1); 230#L518 assume !(0 == strcat_#t~mem9);havoc strcat_#t~mem9;strcat_#t~pre10.base, strcat_#t~pre10.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre10.base, strcat_#t~pre10.offset;strcat_#t~pre11.base, strcat_#t~pre11.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre11.base, strcat_#t~pre11.offset;call strcat_#t~mem12 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem12, strcat_~s.base, strcat_~s.offset, 1); 228#L519 assume !(0 == strcat_#t~mem12);havoc strcat_#t~mem12;strcat_#t~pre13.base, strcat_#t~pre13.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre13.base, strcat_#t~pre13.offset;strcat_#t~pre14.base, strcat_#t~pre14.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre14.base, strcat_#t~pre14.offset;call strcat_#t~mem15 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem15, strcat_~s.base, strcat_~s.offset, 1); 227#L520 assume !(0 == strcat_#t~mem15);havoc strcat_#t~mem15;strcat_#t~pre16.base, strcat_#t~pre16.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre16.base, strcat_#t~pre16.offset;strcat_#t~pre17.base, strcat_#t~pre17.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre17.base, strcat_#t~pre17.offset; 221#L516-2 [2019-10-22 08:54:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2019-10-22 08:54:23,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267026508] [2019-10-22 08:54:23,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,111 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash 73640536, now seen corresponding path program 2 times [2019-10-22 08:54:23,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494430453] [2019-10-22 08:54:23,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:23,139 INFO L82 PathProgramCache]: Analyzing trace with hash 648918087, now seen corresponding path program 1 times [2019-10-22 08:54:23,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:23,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853521911] [2019-10-22 08:54:23,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:23,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:23,199 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:23,581 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 104 [2019-10-22 08:54:24,008 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 122 [2019-10-22 08:54:24,142 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-10-22 08:54:24,144 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:24,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:24,145 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:24,145 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:24,145 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:24,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:24,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:24,145 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:24,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat.i_Iteration3_Lasso [2019-10-22 08:54:24,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:24,145 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:24,149 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:54:24,157 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:54:24,159 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:54:24,160 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:54:24,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:24,164 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:54:24,655 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-10-22 08:54:24,681 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 08:54:24,684 INFO L168 Benchmark]: Toolchain (without parser) took 6460.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 268.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:24,685 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:24,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:24,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.97 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:54:24,686 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 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:54:24,686 INFO L168 Benchmark]: RCFGBuilder took 499.45 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:24,687 INFO L168 Benchmark]: BuchiAutomizer took 5437.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:24,690 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 450.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.97 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 28.71 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 499.45 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5437.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 270.7 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...