./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcat.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcat.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31c220d29d6dec1ef33d2c1aa086e47a745ff101 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:14:12,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:14:12,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:14:12,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:14:12,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:14:12,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:14:12,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:14:12,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:14:12,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:14:12,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:14:12,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:14:12,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:14:12,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:14:12,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:14:12,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:14:12,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:14:12,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:14:12,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:14:12,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:14:12,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:14:12,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:14:12,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:14:12,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:14:12,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:14:12,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:14:12,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:14:12,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:14:12,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:14:12,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:14:12,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:14:12,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:14:12,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:14:12,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:14:12,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:14:12,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:14:12,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:14:12,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:14:12,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:14:12,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:14:12,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:14:12,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:14:12,286 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:14:12,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:14:12,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:14:12,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:14:12,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:14:12,305 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:14:12,305 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:14:12,305 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:14:12,305 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:14:12,306 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:14:12,306 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:14:12,306 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:14:12,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:14:12,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:14:12,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:14:12,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:14:12,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:14:12,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:14:12,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:14:12,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:14:12,308 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:14:12,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:14:12,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:14:12,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:14:12,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:14:12,309 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:14:12,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:14:12,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:14:12,310 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:14:12,311 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:14:12,311 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2019-11-15 22:14:12,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:14:12,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:14:12,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:14:12,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:14:12,374 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:14:12,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat.i [2019-11-15 22:14:12,429 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/data/09766d8da/fa8e83792be94820b4160aa161be620d/FLAGc51af54d7 [2019-11-15 22:14:12,984 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:14:12,985 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/sv-benchmarks/c/termination-libowfat/strlcat.i [2019-11-15 22:14:13,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/data/09766d8da/fa8e83792be94820b4160aa161be620d/FLAGc51af54d7 [2019-11-15 22:14:13,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/data/09766d8da/fa8e83792be94820b4160aa161be620d [2019-11-15 22:14:13,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:14:13,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:14:13,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:14:13,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:14:13,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:14:13,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a22a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13, skipping insertion in model container [2019-11-15 22:14:13,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,333 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:14:13,386 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:14:13,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:14:13,811 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:14:13,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:14:13,891 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:14:13,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13 WrapperNode [2019-11-15 22:14:13,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:14:13,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:14:13,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:14:13,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:14:13,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:14:13,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:14:13,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:14:13,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:14:13,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... [2019-11-15 22:14:13,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:14:13,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:14:13,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:14:13,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:14:13,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c264b5fa-baad-4bc7-a807-3cd8d7bc1cdc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:14:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:14:14,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:14:14,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:14:14,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:14:14,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:14:14,464 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 22:14:14,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:14:14 BoogieIcfgContainer [2019-11-15 22:14:14,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:14:14,467 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:14:14,467 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:14:14,470 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:14:14,471 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:14:14,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:14:13" (1/3) ... [2019-11-15 22:14:14,472 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@503f7d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:14:14, skipping insertion in model container [2019-11-15 22:14:14,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:14:14,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:13" (2/3) ... [2019-11-15 22:14:14,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@503f7d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:14:14, skipping insertion in model container [2019-11-15 22:14:14,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:14:14,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:14:14" (3/3) ... [2019-11-15 22:14:14,476 INFO L371 chiAutomizerObserver]: Analyzing ICFG strlcat.i [2019-11-15 22:14:14,520 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:14:14,520 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:14:14,521 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:14:14,521 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:14:14,521 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:14:14,521 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:14:14,521 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:14:14,521 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:14:14,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 22:14:14,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 22:14:14,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:14,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:14,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:14:14,559 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:14:14,559 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:14:14,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-11-15 22:14:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 22:14:14,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:14,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:14,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:14:14,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:14:14,568 INFO L791 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.allocOnStack(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.allocOnStack(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 [2019-11-15 22:14:14,568 INFO L793 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~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7;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 [2019-11-15 22:14:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-15 22:14:14,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:14,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335187613] [2019-11-15 22:14:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:14,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2019-11-15 22:14:14,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:14,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802505612] [2019-11-15 22:14:14,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,822 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2019-11-15 22:14:14,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:14,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327727031] [2019-11-15 22:14:14,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:14,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:14,980 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:15,147 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-11-15 22:14:15,783 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-11-15 22:14:16,005 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 22:14:16,018 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:14:16,020 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:14:16,021 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:14:16,021 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:14:16,021 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:14:16,021 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:16,021 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:14:16,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:14:16,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration1_Lasso [2019-11-15 22:14:16,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:14:16,023 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:14:16,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,560 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-15 22:14:16,678 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-15 22:14:16,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:16,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:17,727 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:14:17,791 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:14:17,796 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:14:17,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,803 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,809 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:17,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:17,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,845 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:17,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:17,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:17,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:17,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:17,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:17,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:17,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:17,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:17,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:17,879 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:17,949 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:14:17,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:14:17,992 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:14:17,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:14:17,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:14:17,997 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:14:17,998 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_strlcat_~d~0.base)_1 Supporting invariants [] [2019-11-15 22:14:18,028 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 22:14:18,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:14:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:14:18,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:18,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:14:18,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:18,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:14:18,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-11-15 22:14:18,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 76 states and 104 transitions. Complement of second has 7 states. [2019-11-15 22:14:18,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:14:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2019-11-15 22:14:18,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 22:14:18,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:18,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 22:14:18,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:18,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 22:14:18,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:18,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 104 transitions. [2019-11-15 22:14:18,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-15 22:14:18,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 36 states and 45 transitions. [2019-11-15 22:14:18,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:14:18,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 22:14:18,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-15 22:14:18,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:14:18,271 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-15 22:14:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-15 22:14:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-15 22:14:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:14:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 22:14:18,297 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 22:14:18,298 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 22:14:18,298 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:14:18,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-15 22:14:18,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:14:18,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:18,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:18,300 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:18,300 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:14:18,301 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#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; 205#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(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; 203#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(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; 184#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 186#L521-1 assume !strlcat_#t~short7; 207#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 198#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; 199#L525 assume !(0 == strlcat_~n~0 % 4294967296); 195#L527-3 [2019-11-15 22:14:18,301 INFO L793 eck$LassoCheckResult]: Loop: 195#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 190#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 191#L528 assume !(1 != strlcat_~n~0 % 4294967296); 194#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; 195#L527-3 [2019-11-15 22:14:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2019-11-15 22:14:18,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:18,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608048814] [2019-11-15 22:14:18,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2019-11-15 22:14:18,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:18,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913067254] [2019-11-15 22:14:18,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2019-11-15 22:14:18,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:18,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101904966] [2019-11-15 22:14:18,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:18,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:18,442 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:19,045 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-11-15 22:14:19,697 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-11-15 22:14:19,700 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:14:19,700 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:14:19,700 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:14:19,700 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:14:19,700 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:14:19,700 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:19,700 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:14:19,701 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:14:19,701 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration2_Lasso [2019-11-15 22:14:19,701 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:14:19,701 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:14:19,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:19,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:20,268 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-11-15 22:14:20,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:20,866 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-15 22:14:21,434 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:14:21,580 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 22:14:21,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:14:21,613 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:14:21,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,618 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,619 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,622 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,642 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,648 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,659 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,671 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,679 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:21,679 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,681 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,682 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,683 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,688 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,693 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,693 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,698 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,698 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,708 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:14:21,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,714 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:14:21,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:21,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,750 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:14:21,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,751 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:14:21,751 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:21,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,756 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:21,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:21,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:21,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:21,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:21,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:21,764 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:21,764 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:21,822 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:14:21,881 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:14:21,881 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:14:21,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:14:21,883 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:14:21,883 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:14:21,884 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_strlcat_~s~0.base)_1) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_strlcat_~s~0.base)_1 Supporting invariants [] [2019-11-15 22:14:21,957 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-11-15 22:14:21,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:14:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:22,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:14:22,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:22,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:14:22,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:22,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:14:22,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 22:14:22,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 4 states. [2019-11-15 22:14:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:14:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-11-15 22:14:22,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 22:14:22,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:22,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2019-11-15 22:14:22,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:22,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2019-11-15 22:14:22,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:22,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-11-15 22:14:22,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:14:22,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2019-11-15 22:14:22,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:14:22,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:14:22,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-15 22:14:22,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:14:22,104 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 22:14:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-15 22:14:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 22:14:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 22:14:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-15 22:14:22,106 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 22:14:22,106 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 22:14:22,106 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:14:22,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-15 22:14:22,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:14:22,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:14:22,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:14:22,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:22,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:14:22,108 INFO L791 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#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; 372#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(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; 370#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(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; 361#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 363#L521-1 assume !strlcat_#t~short7; 374#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 367#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; 368#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; 369#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 365#L509-4 [2019-11-15 22:14:22,109 INFO L793 eck$LassoCheckResult]: Loop: 365#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 366#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; 376#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; 365#L509-4 [2019-11-15 22:14:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2019-11-15 22:14:22,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:22,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112515551] [2019-11-15 22:14:22,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2019-11-15 22:14:22,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:22,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359634722] [2019-11-15 22:14:22,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,152 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2019-11-15 22:14:22,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:22,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709041331] [2019-11-15 22:14:22,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:14:22,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:14:22,819 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2019-11-15 22:14:23,403 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-11-15 22:14:23,405 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:14:23,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:14:23,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:14:23,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:14:23,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:14:23,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:14:23,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:14:23,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:14:23,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat.i_Iteration3_Lasso [2019-11-15 22:14:23,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:14:23,406 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:14:23,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:23,957 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-11-15 22:14:24,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:14:24,479 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-11-15 22:14:25,109 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 22:14:25,270 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 22:14:25,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:14:25,305 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:14:25,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,320 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,340 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,341 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,344 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,344 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:14:25,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:14:25,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:14:25,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,389 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,389 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,396 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:14:25,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,401 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:14:25,402 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,430 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,430 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:14:25,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:14:25,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:14:25,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:14:25,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:14:25,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:14:25,437 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:14:25,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:14:25,466 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:14:25,507 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:14:25,509 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:14:25,510 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:14:25,511 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:14:25,512 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:14:25,513 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-11-15 22:14:25,596 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 22:14:25,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:14:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:25,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:14:25,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:25,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:14:25,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:25,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:14:25,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:14:25,716 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 4 states. [2019-11-15 22:14:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:14:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:14:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 22:14:25,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 22:14:25,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:25,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-15 22:14:25,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:25,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 22:14:25,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:14:25,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-15 22:14:25,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:14:25,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-15 22:14:25,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:14:25,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:14:25,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:14:25,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:14:25,721 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:14:25,721 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:14:25,721 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:14:25,721 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:14:25,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:14:25,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:14:25,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:14:25,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:14:25 BoogieIcfgContainer [2019-11-15 22:14:25,736 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:14:25,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:14:25,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:14:25,737 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:14:25,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:14:14" (3/4) ... [2019-11-15 22:14:25,742 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:14:25,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:14:25,745 INFO L168 Benchmark]: Toolchain (without parser) took 12427.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 944.7 MB in the beginning and 861.8 MB in the end (delta: 83.0 MB). Peak memory consumption was 401.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:25,745 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:14:25,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:25,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:14:25,747 INFO L168 Benchmark]: Boogie Preprocessor took 29.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:14:25,748 INFO L168 Benchmark]: RCFGBuilder took 495.47 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.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:25,750 INFO L168 Benchmark]: BuchiAutomizer took 11269.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 861.8 MB in the end (delta: 215.8 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:14:25,755 INFO L168 Benchmark]: Witness Printer took 5.60 ms. Allocated memory is still 1.3 GB. Free memory is still 861.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:14:25,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 574.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 495.47 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.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11269.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 861.8 MB in the end (delta: 215.8 MB). Peak memory consumption was 404.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.60 ms. Allocated memory is still 1.3 GB. Free memory is still 861.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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[d] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 10.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: 59 SDtfs, 89 SDslu, 27 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp44 div189 bol100 ite100 ukn100 eq163 hnf64 smp93 dnf207 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...