./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fd4754e908bed6ae29d10e34d903201d1cfa0296 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:04:29,023 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:04:29,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:04:29,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:04:29,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:04:29,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:04:29,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:04:29,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:04:29,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:04:29,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:04:29,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:04:29,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:04:29,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:04:29,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:04:29,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:04:29,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:04:29,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:04:29,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:04:29,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:04:29,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:04:29,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:04:29,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:04:29,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:04:29,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:04:29,042 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:04:29,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:04:29,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:04:29,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:04:29,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:04:29,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:04:29,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:04:29,045 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:04:29,045 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:04:29,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:04:29,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:04:29,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:04:29,046 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 08:04:29,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:04:29,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:04:29,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:04:29,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:04:29,055 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:04:29,055 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:04:29,055 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:04:29,055 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:04:29,056 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:04:29,056 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:04:29,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:04:29,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:04:29,057 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:04:29,058 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:04:29,058 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-12-08 08:04:29,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:04:29,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:04:29,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:04:29,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:04:29,083 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:04:29,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-12-08 08:04:29,119 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/data/eaaf7ee56/3f67ace5cdef4a66ad959977b63f1d40/FLAGaaaea5451 [2018-12-08 08:04:29,424 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:04:29,424 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-12-08 08:04:29,430 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/data/eaaf7ee56/3f67ace5cdef4a66ad959977b63f1d40/FLAGaaaea5451 [2018-12-08 08:04:29,439 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/data/eaaf7ee56/3f67ace5cdef4a66ad959977b63f1d40 [2018-12-08 08:04:29,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:04:29,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:04:29,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:04:29,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:04:29,444 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:04:29,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ade0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29, skipping insertion in model container [2018-12-08 08:04:29,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:04:29,478 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:04:29,629 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:04:29,635 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:04:29,698 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:04:29,717 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:04:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29 WrapperNode [2018-12-08 08:04:29,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:04:29,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:04:29,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:04:29,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:04:29,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:04:29,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:04:29,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:04:29,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:04:29,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... [2018-12-08 08:04:29,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:04:29,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:04:29,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:04:29,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:04:29,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_52604af1-5eef-4473-91f6-df3cfa5a77ae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:04:29,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:04:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:04:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:04:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:04:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:04:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:04:29,950 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:04:29,950 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 08:04:29,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:04:29 BoogieIcfgContainer [2018-12-08 08:04:29,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:04:29,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:04:29,951 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:04:29,953 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:04:29,954 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:04:29,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:04:29" (1/3) ... [2018-12-08 08:04:29,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b13ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:04:29, skipping insertion in model container [2018-12-08 08:04:29,955 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:04:29,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:04:29" (2/3) ... [2018-12-08 08:04:29,955 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b13ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:04:29, skipping insertion in model container [2018-12-08 08:04:29,955 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:04:29,955 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:04:29" (3/3) ... [2018-12-08 08:04:29,956 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-12-08 08:04:29,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:04:29,990 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:04:29,990 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:04:29,990 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:04:29,990 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:04:29,990 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:04:29,990 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:04:29,990 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:04:29,991 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:04:29,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-08 08:04:30,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 08:04:30,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:04:30,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:04:30,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 08:04:30,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:04:30,016 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:04:30,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-08 08:04:30,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 08:04:30,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:04:30,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:04:30,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 08:04:30,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 08:04:30,023 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 12#L515-4true [2018-12-08 08:04:30,023 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~mem7;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2018-12-08 08:04:30,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-12-08 08:04:30,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-12-08 08:04:30,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:30,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-12-08 08:04:30,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:30,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:30,529 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-12-08 08:04:30,625 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:04:30,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:04:30,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:04:30,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:04:30,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:04:30,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:04:30,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:04:30,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:04:30,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-12-08 08:04:30,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:04:30,627 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:04:30,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,872 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-08 08:04:30,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:30,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:31,251 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-12-08 08:04:31,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:04:31,549 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:04:31,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:31,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:31,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:31,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:31,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:31,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:31,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:31,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:31,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:31,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:31,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:31,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:31,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:31,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:31,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:31,647 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:04:31,674 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:04:31,674 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:04:31,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:04:31,676 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:04:31,676 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:04:31,677 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-12-08 08:04:31,715 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-08 08:04:31,721 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:04:31,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:31,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:31,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:04:31,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 08:04:31,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-12-08 08:04:31,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 50 states and 71 transitions. Complement of second has 7 states. [2018-12-08 08:04:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:04:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:04:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-12-08 08:04:31,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-08 08:04:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:31,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-08 08:04:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:31,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-08 08:04:31,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:31,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2018-12-08 08:04:31,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:04:31,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 10 states and 12 transitions. [2018-12-08 08:04:31,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 08:04:31,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:04:31,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-08 08:04:31,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:04:31,889 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-08 08:04:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-08 08:04:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-08 08:04:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 08:04:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-08 08:04:31,911 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-08 08:04:31,911 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-08 08:04:31,911 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:04:31,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-08 08:04:31,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:04:31,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:04:31,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:04:31,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:04:31,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:04:31,912 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10; 184#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 191#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 189#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 190#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 192#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 187#L521 assume !(0 != strlcpy_~siz % 4294967296); 185#L523-2 [2018-12-08 08:04:31,912 INFO L796 eck$LassoCheckResult]: Loop: 185#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 186#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 185#L523-2 [2018-12-08 08:04:31,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-12-08 08:04:31,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:31,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:31,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:31,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:04:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:04:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:04:31,996 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:04:31,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2018-12-08 08:04:31,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:31,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:31,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 08:04:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 08:04:32,023 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-08 08:04:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:04:32,054 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-08 08:04:32,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:04:32,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-08 08:04:32,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-08 08:04:32,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-12-08 08:04:32,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 08:04:32,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 08:04:32,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-12-08 08:04:32,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:04:32,056 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-08 08:04:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-12-08 08:04:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-08 08:04:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 08:04:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-08 08:04:32,057 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-08 08:04:32,057 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-08 08:04:32,057 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:04:32,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-08 08:04:32,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:04:32,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:04:32,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:04:32,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:04:32,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:04:32,059 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10; 218#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 223#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 224#L514 assume !strlcpy_#t~short3; 225#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 229#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 228#L521 assume !(0 != strlcpy_~siz % 4294967296); 220#L523-2 [2018-12-08 08:04:32,059 INFO L796 eck$LassoCheckResult]: Loop: 220#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 221#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 220#L523-2 [2018-12-08 08:04:32,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,059 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-12-08 08:04:32,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:32,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2018-12-08 08:04:32,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:32,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2018-12-08 08:04:32,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:04:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,275 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2018-12-08 08:04:32,337 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:04:32,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:04:32,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:04:32,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:04:32,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:04:32,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:04:32,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:04:32,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:04:32,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-12-08 08:04:32,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:04:32,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:04:32,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,486 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-08 08:04:32,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:32,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:04:32,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:04:32,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:32,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:32,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:04:32,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 08:04:32,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:32,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:32,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:32,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:32,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:32,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:32,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:32,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:32,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:32,873 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:04:32,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:04:32,879 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:04:32,879 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:04:32,880 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:04:32,880 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:04:32,880 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-12-08 08:04:32,893 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 08:04:32,894 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:04:32,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:32,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:32,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:04:32,946 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 08:04:32,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-08 08:04:32,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 17 states and 19 transitions. Complement of second has 5 states. [2018-12-08 08:04:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:04:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:04:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-08 08:04:32,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 08:04:32,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:32,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 08:04:32,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:32,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-08 08:04:32,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:32,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-12-08 08:04:32,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:04:32,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 14 transitions. [2018-12-08 08:04:32,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 08:04:32,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 08:04:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-12-08 08:04:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:04:32,965 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-08 08:04:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-12-08 08:04:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-12-08 08:04:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 08:04:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-08 08:04:32,966 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-08 08:04:32,966 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-08 08:04:32,966 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:04:32,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-12-08 08:04:32,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 08:04:32,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:04:32,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:04:32,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:04:32,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 08:04:32,967 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10; 333#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 338#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 339#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 340#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 341#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 334#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 335#L523-2 [2018-12-08 08:04:32,967 INFO L796 eck$LassoCheckResult]: Loop: 335#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 336#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 335#L523-2 [2018-12-08 08:04:32,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-12-08 08:04:32,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2018-12-08 08:04:32,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:04:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2018-12-08 08:04:32,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:04:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:04:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:04:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:04:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:04:33,251 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2018-12-08 08:04:33,321 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:04:33,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:04:33,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:04:33,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:04:33,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:04:33,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:04:33,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:04:33,322 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:04:33,322 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-12-08 08:04:33,322 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:04:33,322 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:04:33,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,496 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-12-08 08:04:33,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:04:33,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:04:33,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:04:33,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:04:33,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:04:33,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,813 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:04:33,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 08:04:33,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:04:33,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,820 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:04:33,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:04:33,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:04:33,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,828 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:04:33,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:04:33,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:04:33,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:04:33,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:04:33,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:04:33,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:04:33,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:04:33,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:04:33,841 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:04:33,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:04:33,848 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:04:33,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:04:33,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:04:33,849 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:04:33,849 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-12-08 08:04:33,870 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 08:04:33,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:04:33,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:04:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:33,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:04:33,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:04:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:04:33,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-08 08:04:33,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-08 08:04:33,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 12 states and 13 transitions. Complement of second has 5 states. [2018-12-08 08:04:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 08:04:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:04:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 08:04:33,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 08:04:33,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:33,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 08:04:33,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:33,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-08 08:04:33,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:04:33,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-08 08:04:33,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:04:33,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-08 08:04:33,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:04:33,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:04:33,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:04:33,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:04:33,930 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:04:33,930 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:04:33,930 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:04:33,930 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:04:33,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:04:33,930 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:04:33,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:04:33,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:04:33 BoogieIcfgContainer [2018-12-08 08:04:33,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:04:33,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:04:33,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:04:33,935 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:04:33,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:04:29" (3/4) ... [2018-12-08 08:04:33,938 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:04:33,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:04:33,939 INFO L168 Benchmark]: Toolchain (without parser) took 4498.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 956.0 MB in the beginning and 874.0 MB in the end (delta: 81.9 MB). Peak memory consumption was 422.2 MB. Max. memory is 11.5 GB. [2018-12-08 08:04:33,939 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:04:33,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:04:33,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.28 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. [2018-12-08 08:04:33,940 INFO L168 Benchmark]: Boogie Preprocessor took 16.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:04:33,941 INFO L168 Benchmark]: RCFGBuilder took 190.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:04:33,941 INFO L168 Benchmark]: BuchiAutomizer took 3984.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 883.6 MB in the end (delta: 232.6 MB). Peak memory consumption was 411.9 MB. Max. memory is 11.5 GB. [2018-12-08 08:04:33,941 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.4 GB. Free memory was 883.6 MB in the beginning and 874.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:04:33,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.28 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 16.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3984.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 883.6 MB in the end (delta: 232.6 MB). Peak memory consumption was 411.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.4 GB. Free memory was 883.6 MB in the beginning and 874.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 53 SDslu, 33 SDs, 0 SdLazy, 35 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...