./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:41:45,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:41:45,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:41:45,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:41:45,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:41:45,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:41:45,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:41:45,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:41:45,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:41:45,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:41:45,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:41:45,162 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:41:45,163 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:41:45,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:41:45,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:41:45,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:41:45,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:41:45,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:41:45,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:41:45,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:41:45,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:41:45,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:41:45,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:41:45,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:41:45,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:41:45,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:41:45,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:41:45,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:41:45,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:41:45,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:41:45,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:41:45,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:41:45,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:41:45,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:41:45,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:41:45,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:41:45,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:41:45,223 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:41:45,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:41:45,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:41:45,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:41:45,226 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:41:45,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:41:45,227 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:41:45,227 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:41:45,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:41:45,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:41:45,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:41:45,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:41:45,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:41:45,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:41:45,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:41:45,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:41:45,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:41:45,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:41:45,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:41:45,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:41:45,230 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:41:45,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:41:45,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:41:45,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:41:45,233 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:41:45,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:41:45,234 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:41:45,235 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:41:45,236 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:41:45,237 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2019-01-01 21:41:45,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:41:45,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:41:45,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:41:45,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:41:45,303 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:41:45,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2019-01-01 21:41:45,392 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47434f5ce/0d3ca04238924463be6cd6cddf90e2c2/FLAG84896c45e [2019-01-01 21:41:46,014 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:41:46,015 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2019-01-01 21:41:46,038 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47434f5ce/0d3ca04238924463be6cd6cddf90e2c2/FLAG84896c45e [2019-01-01 21:41:46,267 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47434f5ce/0d3ca04238924463be6cd6cddf90e2c2 [2019-01-01 21:41:46,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:41:46,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:41:46,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:46,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:41:46,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:41:46,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:46" (1/1) ... [2019-01-01 21:41:46,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf8b1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:46, skipping insertion in model container [2019-01-01 21:41:46,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:41:46" (1/1) ... [2019-01-01 21:41:46,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:41:46,395 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:41:46,800 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:46,814 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:41:46,972 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:41:47,048 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:41:47,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47 WrapperNode [2019-01-01 21:41:47,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:41:47,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:47,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:41:47,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:41:47,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:41:47,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:41:47,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:41:47,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:41:47,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... [2019-01-01 21:41:47,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:41:47,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:41:47,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:41:47,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:41:47,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:47,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:41:47,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:41:47,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:41:47,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:41:47,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:41:47,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:41:47,836 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:41:47,836 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-01 21:41:47,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:47 BoogieIcfgContainer [2019-01-01 21:41:47,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:41:47,838 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:41:47,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:41:47,842 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:41:47,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:47,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:41:46" (1/3) ... [2019-01-01 21:41:47,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a6c8b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:47, skipping insertion in model container [2019-01-01 21:41:47,846 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:47,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:41:47" (2/3) ... [2019-01-01 21:41:47,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a6c8b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:41:47, skipping insertion in model container [2019-01-01 21:41:47,847 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:41:47,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:47" (3/3) ... [2019-01-01 21:41:47,850 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2019-01-01 21:41:47,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:41:47,922 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:41:47,922 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:41:47,923 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:41:47,923 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:41:47,923 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:41:47,923 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:41:47,923 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:41:47,923 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:41:47,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-01 21:41:47,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 21:41:47,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:47,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:47,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:47,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:47,979 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:41:47,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-01 21:41:47,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 21:41:47,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:47,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:47,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:41:47,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:47,992 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 23#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 14#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 3#L521-5true [2019-01-01 21:41:47,992 INFO L796 eck$LassoCheckResult]: Loop: 3#L521-5true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 18#L521-1true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 22#L521-3true assume !!strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 3#L521-5true [2019-01-01 21:41:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-01 21:41:48,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2019-01-01 21:41:48,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2019-01-01 21:41:48,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:48,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:49,148 WARN L181 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-01 21:41:50,375 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-01-01 21:41:50,649 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 21:41:50,665 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:50,666 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:50,666 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:50,667 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:50,667 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:50,667 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:50,667 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:50,667 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:50,668 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:41:50,668 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:50,668 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:50,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:50,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,282 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-01 21:41:51,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:51,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:52,723 WARN L181 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:41:52,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:52,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:52,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 [2019-01-01 21:41:52,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,847 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 [2019-01-01 21:41:52,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:52,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:52,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,872 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 [2019-01-01 21:41:52,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,880 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 [2019-01-01 21:41:52,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,886 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 [2019-01-01 21:41:52,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,889 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 [2019-01-01 21:41:52,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,892 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 [2019-01-01 21:41:52,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,895 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 [2019-01-01 21:41:52,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,898 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 [2019-01-01 21:41:52,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:52,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:52,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:52,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:52,902 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 [2019-01-01 21:41:52,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:52,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:52,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:52,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:52,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:52,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:52,946 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:52,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:41:52,999 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:41:53,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:53,005 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:53,008 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:53,009 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 Supporting invariants [] [2019-01-01 21:41:53,131 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:41:53,147 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:53,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:53,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:53,338 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 [2019-01-01 21:41:53,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 4 states. [2019-01-01 21:41:53,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 4 states. Result 73 states and 101 transitions. Complement of second has 9 states. [2019-01-01 21:41:53,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:41:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2019-01-01 21:41:53,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:41:53,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:53,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:41:53,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:53,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:41:53,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:53,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2019-01-01 21:41:53,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 21:41:53,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 36 states and 45 transitions. [2019-01-01 21:41:53,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 21:41:53,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-01 21:41:53,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-01-01 21:41:53,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:53,555 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-01 21:41:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-01-01 21:41:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-01 21:41:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 21:41:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-01 21:41:53,583 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 21:41:53,584 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-01 21:41:53,584 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:41:53,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-01-01 21:41:53,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-01 21:41:53,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:53,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:53,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:53,586 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:41:53,586 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 211#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 209#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 190#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 192#L521-1 assume !strlcat_#t~short7; 213#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 204#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 205#L525 assume !(0 == strlcat_~n~0 % 4294967296); 201#L527-3 [2019-01-01 21:41:53,587 INFO L796 eck$LassoCheckResult]: Loop: 201#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 196#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 197#L528 assume !(1 != strlcat_~n~0 % 4294967296); 200#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 201#L527-3 [2019-01-01 21:41:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:53,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2019-01-01 21:41:53,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:53,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:53,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2019-01-01 21:41:53,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:53,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:53,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:53,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2019-01-01 21:41:53,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:53,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:53,871 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 21:41:54,494 WARN L181 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-01-01 21:41:55,234 WARN L181 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-01-01 21:41:55,237 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:41:55,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:41:55,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:41:55,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:41:55,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:41:55,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:41:55,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:41:55,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:41:55,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:41:55,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:41:55,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:41:55,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:55,914 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-01-01 21:41:56,028 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 21:41:56,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:41:56,773 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-01-01 21:41:57,399 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:41:57,572 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 21:41:57,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:41:57,641 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:41:57,642 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 [2019-01-01 21:41:57,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:57,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,649 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 [2019-01-01 21:41:57,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:57,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,661 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 [2019-01-01 21:41:57,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,667 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 [2019-01-01 21:41:57,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,676 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 [2019-01-01 21:41:57,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,679 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 [2019-01-01 21:41:57,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,686 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 [2019-01-01 21:41:57,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:41:57,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,699 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 [2019-01-01 21:41:57,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,711 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 [2019-01-01 21:41:57,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,719 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 [2019-01-01 21:41:57,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,727 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 [2019-01-01 21:41:57,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,733 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 [2019-01-01 21:41:57,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,736 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 [2019-01-01 21:41:57,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,739 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 [2019-01-01 21:41:57,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,741 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 [2019-01-01 21:41:57,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,747 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 [2019-01-01 21:41:57,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,750 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 [2019-01-01 21:41:57,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:41:57,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,753 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 [2019-01-01 21:41:57,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,758 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 [2019-01-01 21:41:57,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,763 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 [2019-01-01 21:41:57,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,768 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 [2019-01-01 21:41:57,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,779 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 [2019-01-01 21:41:57,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,780 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:41:57,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,786 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:41:57,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,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 [2019-01-01 21:41:57,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,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 [2019-01-01 21:41:57,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:41:57,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,826 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:41:57,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:41:57,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:41:57,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,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 [2019-01-01 21:41:57,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:41:57,835 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 [2019-01-01 21:41:57,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:41:57,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:41:57,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:41:57,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:41:57,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:41:57,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:41:57,878 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:41:57,910 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:41:57,910 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:41:57,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:41:57,912 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:41:57,912 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:41:57,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2 Supporting invariants [] [2019-01-01 21:41:58,122 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2019-01-01 21:41:58,146 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:41:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:58,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:41:58,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:41:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:41:58,364 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 [2019-01-01 21:41:58,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 21:41:58,419 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 35 states and 44 transitions. Complement of second has 5 states. [2019-01-01 21:41:58,420 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 [2019-01-01 21:41:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:41:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-01 21:41:58,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:41:58,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:58,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-01 21:41:58,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:58,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2019-01-01 21:41:58,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:41:58,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-01-01 21:41:58,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:58,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2019-01-01 21:41:58,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:41:58,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:41:58,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-01 21:41:58,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:41:58,427 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:41:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-01 21:41:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 21:41:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:41:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-01 21:41:58,429 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:41:58,429 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-01 21:41:58,429 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:41:58,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-01 21:41:58,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:41:58,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:41:58,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:41:58,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:41:58,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:41:58,431 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 385#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 383#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 374#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 375#L521-1 assume !strlcat_#t~short7; 387#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;havoc strlcat_#t~short7; 380#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 381#L525 assume 0 == strlcat_~n~0 % 4294967296;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 382#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 378#L509-4 [2019-01-01 21:41:58,431 INFO L796 eck$LassoCheckResult]: Loop: 378#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 379#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 389#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 378#L509-4 [2019-01-01 21:41:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2019-01-01 21:41:58,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:58,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2019-01-01 21:41:58,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:58,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:41:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2019-01-01 21:41:58,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:41:58,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:41:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:41:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:41:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:41:58,754 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 21:41:58,946 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 21:41:59,821 WARN L181 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2019-01-01 21:42:00,453 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-01-01 21:42:00,456 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:00,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:00,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:00,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:00,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:00,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:00,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:00,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:00,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:42:00,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:00,458 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:00,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:00,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:01,217 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-01-01 21:42:01,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:01,791 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-01 21:42:02,525 WARN L181 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-01 21:42:02,698 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 21:42:02,741 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:02,742 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:02,742 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 [2019-01-01 21:42:02,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,749 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 [2019-01-01 21:42:02,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,751 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 [2019-01-01 21:42:02,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,753 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 [2019-01-01 21:42:02,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,755 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 [2019-01-01 21:42:02,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,757 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 [2019-01-01 21:42:02,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,759 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 [2019-01-01 21:42:02,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,762 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 [2019-01-01 21:42:02,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,768 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 [2019-01-01 21:42:02,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,771 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 [2019-01-01 21:42:02,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,773 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 [2019-01-01 21:42:02,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,775 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 [2019-01-01 21:42:02,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,780 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 [2019-01-01 21:42:02,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,782 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 [2019-01-01 21:42:02,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,785 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 [2019-01-01 21:42:02,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,787 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 [2019-01-01 21:42:02,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,789 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 [2019-01-01 21:42:02,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,792 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 [2019-01-01 21:42:02,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,794 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 [2019-01-01 21:42:02,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,797 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 [2019-01-01 21:42:02,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,799 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 [2019-01-01 21:42:02,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,801 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 [2019-01-01 21:42:02,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,808 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 [2019-01-01 21:42:02,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:02,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:02,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:02,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,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 [2019-01-01 21:42:02,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,830 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:42:02,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,835 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:42:02,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,861 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 [2019-01-01 21:42:02,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:02,867 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 [2019-01-01 21:42:02,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:02,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:02,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:02,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:02,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:02,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:02,924 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:02,972 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:42:02,973 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:42:02,973 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:02,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:02,978 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:02,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-01-01 21:42:03,127 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 21:42:03,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:03,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:03,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:03,238 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:42:03,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:42:03,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 4 states. [2019-01-01 21:42:03,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:42:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-01 21:42:03,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:42:03,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:03,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 21:42:03,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:03,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:42:03,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:03,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-01-01 21:42:03,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:03,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-01 21:42:03,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:42:03,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:42:03,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:42:03,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:03,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:03,257 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:03,257 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:03,257 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:42:03,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:42:03,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:03,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:42:03,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:42:03 BoogieIcfgContainer [2019-01-01 21:42:03,267 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:42:03,267 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:42:03,267 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:42:03,267 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:42:03,268 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:41:47" (3/4) ... [2019-01-01 21:42:03,272 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:42:03,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:42:03,273 INFO L168 Benchmark]: Toolchain (without parser) took 16997.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 952.7 MB in the beginning and 920.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 312.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:03,276 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:03,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:03,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:03,279 INFO L168 Benchmark]: Boogie Preprocessor took 75.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:03,279 INFO L168 Benchmark]: RCFGBuilder took 635.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:03,281 INFO L168 Benchmark]: BuchiAutomizer took 15428.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 920.9 MB in the end (delta: 140.2 MB). Peak memory consumption was 313.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:03,282 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.3 GB. Free memory is still 920.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:03,288 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 771.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 635.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15428.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 920.9 MB in the end (delta: 140.2 MB). Peak memory consumption was 313.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.3 GB. Free memory is still 920.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 14.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 73 SDslu, 30 SDs, 0 SdLazy, 31 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp44 div193 bol100 ite100 ukn100 eq162 hnf64 smp93 dnf207 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...