./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 0ed9222f 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-0ed9222-m [2019-01-14 02:24:48,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:24:48,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:24:48,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:24:48,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:24:48,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:24:48,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:24:48,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:24:48,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:24:48,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:24:48,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:24:48,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:24:48,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:24:48,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:24:48,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:24:48,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:24:48,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:24:48,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:24:48,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:24:48,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:24:48,544 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:24:48,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:24:48,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:24:48,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:24:48,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:24:48,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:24:48,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:24:48,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:24:48,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:24:48,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:24:48,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:24:48,564 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:24:48,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:24:48,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:24:48,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:24:48,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:24:48,566 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:24:48,585 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:24:48,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:24:48,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:24:48,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:24:48,586 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:24:48,587 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:24:48,587 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:24:48,587 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:24:48,587 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:24:48,587 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:24:48,588 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:24:48,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:24:48,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:24:48,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:24:48,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:24:48,589 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:24:48,590 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:24:48,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:24:48,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:24:48,590 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:24:48,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:24:48,591 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:24:48,591 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:24:48,592 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:24:48,592 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-14 02:24:48,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:24:48,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:24:48,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:24:48,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:24:48,649 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:24:48,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2019-01-14 02:24:48,710 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460e44c59/b01aea753f7f418ea796e47aa410e02c/FLAG77ca319a2 [2019-01-14 02:24:49,248 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:24:49,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2019-01-14 02:24:49,262 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460e44c59/b01aea753f7f418ea796e47aa410e02c/FLAG77ca319a2 [2019-01-14 02:24:49,548 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460e44c59/b01aea753f7f418ea796e47aa410e02c [2019-01-14 02:24:49,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:24:49,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:24:49,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:24:49,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:24:49,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:24:49,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:49" (1/1) ... [2019-01-14 02:24:49,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263f7525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:49, skipping insertion in model container [2019-01-14 02:24:49,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:24:49" (1/1) ... [2019-01-14 02:24:49,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:24:49,623 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:24:50,018 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:24:50,030 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:24:50,169 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:24:50,221 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:24:50,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50 WrapperNode [2019-01-14 02:24:50,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:24:50,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:24:50,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:24:50,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:24:50,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:24:50,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:24:50,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:24:50,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:24:50,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (1/1) ... [2019-01-14 02:24:50,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:24:50,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:24:50,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:24:50,318 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:24:50,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (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-14 02:24:50,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:24:50,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:24:50,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:24:50,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:24:50,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:24:50,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:24:50,849 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:24:50,850 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 02:24:50,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:24:50 BoogieIcfgContainer [2019-01-14 02:24:50,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:24:50,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:24:50,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:24:50,855 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:24:50,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:50,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:24:49" (1/3) ... [2019-01-14 02:24:50,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fb2ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:24:50, skipping insertion in model container [2019-01-14 02:24:50,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:50,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:24:50" (2/3) ... [2019-01-14 02:24:50,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fb2ee76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:24:50, skipping insertion in model container [2019-01-14 02:24:50,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:24:50,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:24:50" (3/3) ... [2019-01-14 02:24:50,860 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2019-01-14 02:24:50,908 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:24:50,909 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:24:50,909 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:24:50,909 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:24:50,909 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:24:50,910 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:24:50,910 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:24:50,910 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:24:50,910 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:24:50,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:24:50,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 02:24:50,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:50,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:50,956 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:24:50,956 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:24:50,956 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:24:50,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 02:24:50,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 02:24:50,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:50,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:50,960 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:24:50,960 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:24:50,967 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-14 02:24:50,968 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-14 02:24:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-14 02:24:50,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:50,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2019-01-14 02:24:51,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2019-01-14 02:24:51,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:51,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:51,651 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-14 02:24:52,644 WARN L181 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-01-14 02:24:52,859 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-14 02:24:52,870 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:52,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:52,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:52,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:52,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:52,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:52,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:52,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:52,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:24:52,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:52,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:52,897 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-14 02:24:52,924 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-14 02:24:52,959 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-14 02:24:52,967 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-14 02:24:52,969 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-14 02:24:52,975 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-14 02:24:52,979 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-14 02:24:52,984 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-14 02:24:52,989 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-14 02:24:52,991 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-14 02:24:53,421 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-01-14 02:24:53,546 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 02:24:53,547 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-14 02:24:53,550 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-14 02:24:53,553 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-14 02:24:53,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-14 02:24:53,560 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-14 02:24:53,570 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-14 02:24:53,571 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-14 02:24:53,573 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-14 02:24:53,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-14 02:24:53,577 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-14 02:24:53,579 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-14 02:24:53,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-14 02:24:54,683 WARN L181 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:24:54,772 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:54,777 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:54,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-14 02:24:54,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,786 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-14 02:24:54,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:54,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:54,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,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-14 02:24:54,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,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-14 02:24:54,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:54,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:54,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:54,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:54,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,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-14 02:24:54,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:54,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:54,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:54,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:54,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:24:54,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:54,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:54,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:54,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:54,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:54,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:54,855 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:54,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:24:54,879 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:24:54,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:54,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:24:54,884 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:54,884 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-14 02:24:54,993 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:24:55,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:24:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:55,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:24:55,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:24:55,170 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-14 02:24:55,183 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-14 02:24:55,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 4 states. [2019-01-14 02:24:55,326 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-14 02:24:55,329 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-14 02:24:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:24:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2019-01-14 02:24:55,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:24:55,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:55,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:24:55,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:55,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:24:55,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:24:55,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2019-01-14 02:24:55,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-14 02:24:55,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 36 states and 45 transitions. [2019-01-14 02:24:55,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 02:24:55,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:24:55,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-01-14 02:24:55,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:24:55,348 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-01-14 02:24:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-01-14 02:24:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-14 02:24:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:24:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-14 02:24:55,370 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 02:24:55,370 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 02:24:55,370 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:24:55,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-01-14 02:24:55,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:24:55,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:24:55,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:24:55,373 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:24:55,373 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:24:55,373 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-14 02:24:55,373 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-14 02:24:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2019-01-14 02:24:55,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2019-01-14 02:24:55,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:55,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:55,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:24:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2019-01-14 02:24:55,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:24:55,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:24:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:24:55,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:24:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:24:55,716 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:24:56,351 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2019-01-14 02:24:57,023 WARN L181 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-01-14 02:24:57,026 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:24:57,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:24:57,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:24:57,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:24:57,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:24:57,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:24:57,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:24:57,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:24:57,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:24:57,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:24:57,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:24:57,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:57,047 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-14 02:24:57,049 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-14 02:24:57,050 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-14 02:24:57,052 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-14 02:24:57,053 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-14 02:24:57,055 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-14 02:24:57,058 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-14 02:24:57,060 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-14 02:24:57,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:57,065 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-14 02:24:57,067 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-14 02:24:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:57,072 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-14 02:24:57,074 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-14 02:24:57,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:24:57,078 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-14 02:24:57,080 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-14 02:24:57,084 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-14 02:24:57,085 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-14 02:24:57,086 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-14 02:24:57,772 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-01-14 02:24:57,883 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-14 02:24:57,884 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-14 02:24:58,532 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-01-14 02:24:59,135 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:24:59,302 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-14 02:24:59,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:24:59,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:24:59,348 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-14 02:24:59,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,351 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-14 02:24:59,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,353 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-14 02:24:59,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,358 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-14 02:24:59,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,360 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-14 02:24:59,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,371 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-14 02:24:59,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,373 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-14 02:24:59,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,381 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-14 02:24:59,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,386 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-14 02:24:59,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,395 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-14 02:24:59,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,399 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-14 02:24:59,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,410 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-14 02:24:59,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,417 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-14 02:24:59,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,421 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-14 02:24:59,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,424 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-14 02:24:59,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,427 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-14 02:24:59,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,434 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-14 02:24:59,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,438 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-14 02:24:59,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,447 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-14 02:24:59,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,449 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-14 02:24:59,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:24:59,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,452 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-14 02:24:59,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,465 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-14 02:24:59,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,477 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-14 02:24:59,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,484 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-14 02:24:59,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,499 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-14 02:24:59,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,500 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:24:59,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,508 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:24:59,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,569 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-14 02:24:59,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,579 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-14 02:24:59,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:24:59,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,580 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:24:59,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:24:59,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:24:59,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,589 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-14 02:24:59,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:24:59,595 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-14 02:24:59,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:24:59,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:24:59,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:24:59,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:24:59,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:24:59,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:24:59,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:24:59,691 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:24:59,692 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:24:59,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:24:59,693 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:24:59,693 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:24:59,694 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-14 02:24:59,991 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2019-01-14 02:24:59,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:00,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:00,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:00,170 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-14 02:25:00,170 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-14 02:25:00,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-14 02:25:00,217 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-14 02:25:00,217 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-14 02:25:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:25:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 02:25:00,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-14 02:25:00,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:00,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-14 02:25:00,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:00,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2019-01-14 02:25:00,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:00,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-01-14 02:25:00,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:25:00,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2019-01-14 02:25:00,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:25:00,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:25:00,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-14 02:25:00,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:00,223 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:25:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-14 02:25:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:25:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:25:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:25:00,226 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:25:00,227 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:25:00,227 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:25:00,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:25:00,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:25:00,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:00,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:00,228 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:00,228 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:25:00,228 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-14 02:25:00,229 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-14 02:25:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2019-01-14 02:25:00,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:00,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2019-01-14 02:25:00,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:00,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:00,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:00,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2019-01-14 02:25:00,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:00,423 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:25:01,006 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 140 [2019-01-14 02:25:01,632 WARN L181 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-01-14 02:25:01,636 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:01,636 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:01,637 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:01,637 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:01,637 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:01,637 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:01,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:01,638 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:01,638 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:25:01,638 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:01,638 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:01,650 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-14 02:25:01,685 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-14 02:25:01,688 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-14 02:25:01,689 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-14 02:25:01,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,692 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-14 02:25:01,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,696 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-14 02:25:01,699 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-14 02:25:01,702 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-14 02:25:01,704 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-14 02:25:01,708 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-14 02:25:01,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,716 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-14 02:25:01,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,718 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-14 02:25:01,720 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-14 02:25:01,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,733 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-14 02:25:01,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:01,737 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-14 02:25:01,738 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-14 02:25:01,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:02,211 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-01-14 02:25:02,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:02,817 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-14 02:25:03,524 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 02:25:03,694 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-14 02:25:03,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:03,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:03,737 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-14 02:25:03,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,740 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-14 02:25:03,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,744 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-14 02:25:03,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,745 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-14 02:25:03,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,764 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-14 02:25:03,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,766 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-14 02:25:03,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,781 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-14 02:25:03,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,786 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-14 02:25:03,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,795 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-14 02:25:03,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,833 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-14 02:25:03,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:03,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:03,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:03,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,840 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-14 02:25:03,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:03,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,848 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-14 02:25:03,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,863 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-14 02:25:03,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,864 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:25:03,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,869 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:25:03,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:03,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-14 02:25:03,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:03,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:03,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:03,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:03,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:03,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:03,931 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:03,972 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:25:03,972 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:25:03,972 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:03,975 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:03,975 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:03,976 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-14 02:25:04,357 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:25:04,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:04,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:04,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:04,790 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-14 02:25:04,790 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-14 02:25:04,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:25:04,807 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-14 02:25:04,808 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-14 02:25:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:25:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 02:25:04,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:25:04,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:04,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-14 02:25:04,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:04,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:25:04,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:04,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-01-14 02:25:04,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:04,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-14 02:25:04,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:25:04,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:25:04,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:25:04,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:25:04,811 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:04,811 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:04,811 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:04,811 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:25:04,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:25:04,812 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:04,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:25:04,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:25:04 BoogieIcfgContainer [2019-01-14 02:25:04,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:25:04,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:25:04,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:25:04,823 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:25:04,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:24:50" (3/4) ... [2019-01-14 02:25:04,827 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:25:04,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:25:04,831 INFO L168 Benchmark]: Toolchain (without parser) took 15279.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 951.3 MB in the beginning and 905.6 MB in the end (delta: 45.8 MB). Peak memory consumption was 357.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:04,832 INFO L168 Benchmark]: CDTParser took 0.15 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-14 02:25:04,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:04,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:04,834 INFO L168 Benchmark]: Boogie Preprocessor took 31.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:04,835 INFO L168 Benchmark]: RCFGBuilder took 534.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:04,837 INFO L168 Benchmark]: BuchiAutomizer took 13970.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 166.2 MB). Peak memory consumption was 354.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:04,837 INFO L168 Benchmark]: Witness Printer took 7.05 ms. Allocated memory is still 1.3 GB. Free memory is still 905.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:04,844 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 534.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13970.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 905.6 MB in the end (delta: 166.2 MB). Peak memory consumption was 354.9 MB. Max. memory is 11.5 GB. * Witness Printer took 7.05 ms. Allocated memory is still 1.3 GB. Free memory is still 905.6 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 13.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 12.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. 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: 63ms 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...