./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/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 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:14:52,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:14:52,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:14:52,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:14:52,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:14:52,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:14:52,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:14:52,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:14:52,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:14:52,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:14:52,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:14:52,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:14:52,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:14:52,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:14:52,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:14:52,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:14:52,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:14:52,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:14:52,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:14:52,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:14:52,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:14:52,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:14:52,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:14:52,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:14:52,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:14:52,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:14:52,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:14:52,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:14:52,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:14:52,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:14:52,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:14:52,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:14:52,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:14:52,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:14:52,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:14:52,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:14:52,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:14:52,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:14:52,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:14:52,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:14:52,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:14:52,535 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:14:52,535 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:14:52,535 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:14:52,535 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:14:52,535 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:14:52,536 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:14:52,536 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:14:52,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:14:52,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:14:52,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:14:52,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:14:52,537 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:14:52,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:14:52,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:14:52,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:14:52,538 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:14:52,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:14:52,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:14:52,539 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:14:52,539 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:14:52,540 INFO L133 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_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/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 -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2018-11-28 11:14:52,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:14:52,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:14:52,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:14:52,584 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:14:52,584 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:14:52,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-28 11:14:52,630 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/data/3ec1f08c7/304d72b0e088439fba2abd7a07b6b4b2/FLAGcd1380570 [2018-11-28 11:14:53,007 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:14:53,008 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-28 11:14:53,018 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/data/3ec1f08c7/304d72b0e088439fba2abd7a07b6b4b2/FLAGcd1380570 [2018-11-28 11:14:53,389 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/uautomizer/data/3ec1f08c7/304d72b0e088439fba2abd7a07b6b4b2 [2018-11-28 11:14:53,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:14:53,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:14:53,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:14:53,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:14:53,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:14:53,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53, skipping insertion in model container [2018-11-28 11:14:53,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:14:53,436 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:14:53,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:14:53,655 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:14:53,741 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:14:53,766 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:14:53,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53 WrapperNode [2018-11-28 11:14:53,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:14:53,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:14:53,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:14:53,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:14:53,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:14:53,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:14:53,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:14:53,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:14:53,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... [2018-11-28 11:14:53,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:14:53,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:14:53,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:14:53,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:14:53,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b4b54c4-e401-49fa-a70b-16a8c99fe0d8/bin-2019/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 [2018-11-28 11:14:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:14:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:14:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:14:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:14:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:14:53,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:14:54,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:14:54,078 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 11:14:54,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:54 BoogieIcfgContainer [2018-11-28 11:14:54,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:14:54,079 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:14:54,079 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:14:54,081 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:14:54,081 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:14:54,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:53" (1/3) ... [2018-11-28 11:14:54,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64482742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:54, skipping insertion in model container [2018-11-28 11:14:54,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:14:54,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:53" (2/3) ... [2018-11-28 11:14:54,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64482742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:54, skipping insertion in model container [2018-11-28 11:14:54,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:14:54,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:54" (3/3) ... [2018-11-28 11:14:54,084 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2018-11-28 11:14:54,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:14:54,127 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:14:54,127 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:14:54,127 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:14:54,127 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:14:54,127 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:14:54,127 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:14:54,128 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:14:54,128 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:14:54,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 11:14:54,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-28 11:14:54,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:14:54,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:14:54,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:14:54,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:14:54,170 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:14:54,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 11:14:54,171 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-28 11:14:54,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:14:54,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:14:54,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 11:14:54,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:14:54,178 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 23#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 14#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 3#L521-5true [2018-11-28 11:14:54,179 INFO L796 eck$LassoCheckResult]: Loop: 3#L521-5true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 18#L521-1true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 22#L521-3true assume !!strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 3#L521-5true [2018-11-28 11:14:54,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:54,183 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 11:14:54,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:54,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:54,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:54,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2018-11-28 11:14:54,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:54,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:54,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2018-11-28 11:14:54,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:54,491 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-28 11:14:54,888 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-28 11:14:54,984 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:14:54,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:14:54,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:14:54,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:14:54,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:14:54,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:14:54,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:14:54,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:14:54,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:14:54,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:14:54,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:14:55,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,261 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-28 11:14:55,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:55,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:14:55,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:14:55,635 INFO L122 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 [2018-11-28 11:14:55,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,641 INFO L122 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 [2018-11-28 11:14:55,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:55,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:55,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,646 INFO L122 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 [2018-11-28 11:14:55,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,650 INFO L122 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 [2018-11-28 11:14:55,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,653 INFO L122 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 [2018-11-28 11:14:55,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,656 INFO L122 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 [2018-11-28 11:14:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,659 INFO L122 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 [2018-11-28 11:14:55,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,662 INFO L122 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 [2018-11-28 11:14:55,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,665 INFO L122 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 [2018-11-28 11:14:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,668 INFO L122 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 [2018-11-28 11:14:55,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,671 INFO L122 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 [2018-11-28 11:14:55,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:55,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:55,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,677 INFO L122 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 [2018-11-28 11:14:55,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,681 INFO L122 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 [2018-11-28 11:14:55,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,684 INFO L122 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 [2018-11-28 11:14:55,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,687 INFO L122 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 [2018-11-28 11:14:55,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,689 INFO L122 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 [2018-11-28 11:14:55,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,692 INFO L122 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 [2018-11-28 11:14:55,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,694 INFO L122 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 [2018-11-28 11:14:55,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:55,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:55,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:55,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:55,697 INFO L122 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 [2018-11-28 11:14:55,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:55,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:55,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:55,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:55,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:55,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:55,744 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:14:55,768 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:14:55,769 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 11:14:55,771 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:14:55,773 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:14:55,773 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:14:55,773 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 Supporting invariants [] [2018-11-28 11:14:55,815 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 11:14:55,824 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:14:55,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:55,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:55,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:55,933 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:14:55,934 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 4 states. [2018-11-28 11:14:56,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 4 states. Result 73 states and 101 transitions. Complement of second has 9 states. [2018-11-28 11:14:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 11:14:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:14:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-28 11:14:56,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 11:14:56,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:56,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 11:14:56,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:56,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 11:14:56,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:56,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-11-28 11:14:56,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 11:14:56,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 36 states and 45 transitions. [2018-11-28 11:14:56,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 11:14:56,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 11:14:56,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-28 11:14:56,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:14:56,019 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 11:14:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-28 11:14:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 11:14:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 11:14:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 11:14:56,038 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 11:14:56,038 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 11:14:56,038 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:14:56,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-28 11:14:56,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 11:14:56,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:14:56,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:14:56,039 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:14:56,039 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:14:56,040 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 211#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 209#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 190#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 192#L521-1 assume !strlcat_#t~short7; 213#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5; 204#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 205#L525 assume !(0 == strlcat_~n~0 % 4294967296); 201#L527-3 [2018-11-28 11:14:56,040 INFO L796 eck$LassoCheckResult]: Loop: 201#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 196#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 197#L528 assume !(1 != strlcat_~n~0 % 4294967296); 200#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 201#L527-3 [2018-11-28 11:14:56,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2018-11-28 11:14:56,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:56,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2018-11-28 11:14:56,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:56,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:56,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:56,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:56,079 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2018-11-28 11:14:56,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:56,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:56,444 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2018-11-28 11:14:56,738 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-11-28 11:14:56,740 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:14:56,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:14:56,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:14:56,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:14:56,741 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:14:56,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:14:56,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:14:56,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:14:56,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2018-11-28 11:14:56,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:14:56,741 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:14:56,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:56,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:56,975 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-11-28 11:14:57,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:57,251 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2018-11-28 11:14:57,528 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:14:57,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:14:57,529 INFO L122 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 [2018-11-28 11:14:57,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:57,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:14:57,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:57,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,532 INFO L122 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 [2018-11-28 11:14:57,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,532 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:14:57,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:14:57,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,545 INFO L122 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 [2018-11-28 11:14:57,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,549 INFO L122 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 [2018-11-28 11:14:57,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,552 INFO L122 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 [2018-11-28 11:14:57,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,556 INFO L122 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 [2018-11-28 11:14:57,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,563 INFO L122 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 [2018-11-28 11:14:57,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,567 INFO L122 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 [2018-11-28 11:14:57,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:14:57,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:14:57,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:14:57,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:14:57,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,570 INFO L122 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 [2018-11-28 11:14:57,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,571 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:14:57,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,572 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:14:57,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,580 INFO L122 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 [2018-11-28 11:14:57,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:57,584 INFO L122 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 [2018-11-28 11:14:57,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:57,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:57,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:57,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:57,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:57,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:57,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:14:57,644 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 11:14:57,644 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 11:14:57,645 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:14:57,646 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:14:57,647 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:14:57,647 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2 Supporting invariants [] [2018-11-28 11:14:57,687 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-28 11:14:57,689 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:14:57,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:57,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:57,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:57,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 11:14:57,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 11:14:57,810 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 35 states and 44 transitions. Complement of second has 5 states. [2018-11-28 11:14:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:14:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:14:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 11:14:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 11:14:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 11:14:57,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:57,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-28 11:14:57,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:57,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-28 11:14:57,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:14:57,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2018-11-28 11:14:57,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:14:57,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 11:14:57,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 11:14:57,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:14:57,815 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:14:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 11:14:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 11:14:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 11:14:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 11:14:57,817 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:14:57,817 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 11:14:57,817 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:14:57,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 11:14:57,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 11:14:57,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:14:57,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:14:57,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:14:57,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 11:14:57,819 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 385#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 383#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 374#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 375#L521-1 assume !strlcat_#t~short7; 387#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5; 380#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 381#L525 assume 0 == strlcat_~n~0 % 4294967296;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.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; 382#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 378#L509-4 [2018-11-28 11:14:57,819 INFO L796 eck$LassoCheckResult]: Loop: 378#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 379#L509-1 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; 389#L509-3 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; 378#L509-4 [2018-11-28 11:14:57,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2018-11-28 11:14:57,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:57,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2018-11-28 11:14:57,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:57,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2018-11-28 11:14:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:14:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:14:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:14:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:14:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:14:58,398 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 137 [2018-11-28 11:14:58,804 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2018-11-28 11:14:58,805 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:14:58,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:14:58,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:14:58,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:14:58,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:14:58,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:14:58,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:14:58,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:14:58,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:14:58,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:14:58,806 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:14:58,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,050 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-28 11:14:59,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:14:59,298 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-28 11:14:59,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:14:59,606 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:14:59,606 INFO L122 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 [2018-11-28 11:14:59,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:59,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:59,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:59,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:59,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:59,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:59,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:59,614 INFO L122 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 [2018-11-28 11:14:59,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:59,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:59,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:59,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:59,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:59,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:59,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:59,617 INFO L122 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 [2018-11-28 11:14:59,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:59,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:59,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:59,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:59,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:59,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:59,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:59,623 INFO L122 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 [2018-11-28 11:14:59,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:59,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:59,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:59,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:59,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:59,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:59,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:14:59,626 INFO L122 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 [2018-11-28 11:14:59,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:14:59,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:14:59,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:14:59,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:14:59,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:14:59,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:14:59,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:14:59,659 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:14:59,659 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 11:14:59,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:14:59,660 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:14:59,660 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:14:59,660 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3 Supporting invariants [] [2018-11-28 11:14:59,726 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 11:14:59,728 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 11:14:59,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:14:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:59,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:14:59,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:14:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:14:59,783 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 11:14:59,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 11:14:59,834 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 19 states and 24 transitions. Complement of second has 6 states. [2018-11-28 11:14:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 11:14:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:14:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 11:14:59,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 11:14:59,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:59,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 11:14:59,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:59,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 11:14:59,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:14:59,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-28 11:14:59,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:14:59,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-28 11:14:59,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:14:59,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:14:59,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:14:59,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:14:59,838 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:14:59,838 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:14:59,838 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:14:59,838 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:14:59,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:14:59,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:14:59,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:14:59,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:59 BoogieIcfgContainer [2018-11-28 11:14:59,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:14:59,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:14:59,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:14:59,849 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:14:59,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:54" (3/4) ... [2018-11-28 11:14:59,856 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:14:59,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:14:59,857 INFO L168 Benchmark]: Toolchain (without parser) took 6464.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -275.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,858 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:14:59,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.64 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,859 INFO L168 Benchmark]: Boogie Preprocessor took 23.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,860 INFO L168 Benchmark]: RCFGBuilder took 257.80 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: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,860 INFO L168 Benchmark]: BuchiAutomizer took 5769.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:14:59,861 INFO L168 Benchmark]: Witness Printer took 7.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 11:14:59,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.64 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.80 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: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5769.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -152.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 75 SDslu, 40 SDs, 0 SdLazy, 36 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp95 ukn82 mio100 lsp45 div198 bol100 ite100 ukn100 eq162 hnf64 smp93 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...