./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_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 7360833afd5a8b935377ce87ce4cc4a6584d3d0c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:52:47,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:52:47,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:52:47,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:52:47,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:52:47,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:52:47,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:52:47,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:52:47,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:52:47,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:52:47,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:52:47,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:52:47,118 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:52:47,119 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:52:47,120 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:52:47,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:52:47,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:52:47,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:52:47,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:52:47,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:52:47,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:52:47,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:52:47,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:52:47,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:52:47,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:52:47,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:52:47,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:52:47,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:52:47,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:52:47,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:52:47,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:52:47,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:52:47,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:52:47,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:52:47,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:52:47,145 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:52:47,145 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:52:47,163 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:52:47,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:52:47,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:52:47,165 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:52:47,165 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:52:47,165 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:52:47,166 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:52:47,166 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:52:47,167 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:52:47,167 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:52:47,167 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:52:47,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:52:47,167 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:52:47,168 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:52:47,170 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:52:47,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:52:47,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:52:47,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:52:47,171 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:52:47,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:52:47,171 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:52:47,171 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:52:47,173 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:52:47,173 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 -> 7360833afd5a8b935377ce87ce4cc4a6584d3d0c [2019-01-01 21:52:47,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:52:47,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:52:47,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:52:47,254 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:52:47,254 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:52:47,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2019-01-01 21:52:47,317 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d9d766f/44fea920830e4639ace89918d1d45814/FLAGf2fbbbdfa [2019-01-01 21:52:47,784 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:52:47,785 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncat-alloca_true-termination.c.i [2019-01-01 21:52:47,814 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d9d766f/44fea920830e4639ace89918d1d45814/FLAGf2fbbbdfa [2019-01-01 21:52:48,095 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31d9d766f/44fea920830e4639ace89918d1d45814 [2019-01-01 21:52:48,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:52:48,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:52:48,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:48,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:52:48,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:52:48,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ee23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48, skipping insertion in model container [2019-01-01 21:52:48,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:52:48,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:52:48,492 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:48,515 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:52:48,685 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:48,739 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:52:48,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48 WrapperNode [2019-01-01 21:52:48,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:48,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:48,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:52:48,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:52:48,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:48,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:52:48,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:52:48,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:52:48,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... [2019-01-01 21:52:48,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:52:48,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:52:48,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:52:48,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:52:48,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:52:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:52:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:52:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:52:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:52:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:52:49,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:52:49,378 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:52:49,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:49 BoogieIcfgContainer [2019-01-01 21:52:49,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:52:49,381 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:52:49,382 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:52:49,386 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:52:49,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:49,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:52:48" (1/3) ... [2019-01-01 21:52:49,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5901e49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:49, skipping insertion in model container [2019-01-01 21:52:49,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:49,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:48" (2/3) ... [2019-01-01 21:52:49,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5901e49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:49, skipping insertion in model container [2019-01-01 21:52:49,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:49,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:49" (3/3) ... [2019-01-01 21:52:49,397 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-termination.c.i [2019-01-01 21:52:49,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:52:49,462 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:52:49,462 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:52:49,462 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:52:49,462 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:52:49,462 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:52:49,463 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:52:49,463 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:52:49,463 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:52:49,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-01 21:52:49,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:52:49,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:49,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:49,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:52:49,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:52:49,521 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:52:49,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-01 21:52:49,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:52:49,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:49,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:49,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:52:49,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:52:49,537 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~ret13.base, main_#t~ret13.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length2~0 := main_#t~nondet9;havoc main_#t~nondet9;main_~n~0 := main_#t~nondet10;havoc main_#t~nondet10; 4#L568true assume !(main_~length1~0 < 1); 6#L568-2true assume !(main_~length2~0 < 1); 21#L571-1true assume !(main_~n~0 < 1); 13#L574-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~dst.base, cstrncat_#in~dst.offset, cstrncat_#in~src.base, cstrncat_#in~src.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset, cstrncat_#t~mem2, cstrncat_#t~post5.base, cstrncat_#t~post5.offset, cstrncat_#t~mem6, cstrncat_#t~post7.base, cstrncat_#t~post7.offset, cstrncat_#t~pre4, cstrncat_~d~0.base, cstrncat_~d~0.offset, cstrncat_~s~0.base, cstrncat_~s~0.offset, cstrncat_~dst.base, cstrncat_~dst.offset, cstrncat_~src.base, cstrncat_~src.offset, cstrncat_~n;cstrncat_~dst.base, cstrncat_~dst.offset := cstrncat_#in~dst.base, cstrncat_#in~dst.offset;cstrncat_~src.base, cstrncat_~src.offset := cstrncat_#in~src.base, cstrncat_#in~src.offset;cstrncat_~n := cstrncat_#in~n; 18#L550true assume 0 != cstrncat_~n % 4294967296;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_~dst.base, cstrncat_~dst.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~src.base, cstrncat_~src.offset; 19#L553-3true [2019-01-01 21:52:49,540 INFO L796 eck$LassoCheckResult]: Loop: 19#L553-3true call cstrncat_#t~mem2 := read~int(cstrncat_~d~0.base, cstrncat_~d~0.offset, 1); 12#L553-1true assume !!(0 != cstrncat_#t~mem2);havoc cstrncat_#t~mem2;cstrncat_#t~post3.base, cstrncat_#t~post3.offset := cstrncat_~d~0.base, cstrncat_~d~0.offset;cstrncat_~d~0.base, cstrncat_~d~0.offset := cstrncat_#t~post3.base, 1 + cstrncat_#t~post3.offset;havoc cstrncat_#t~post3.base, cstrncat_#t~post3.offset; 19#L553-3true [2019-01-01 21:52:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939629, now seen corresponding path program 1 times [2019-01-01 21:52:49,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:49,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:49,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:49,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-01 21:52:49,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:49,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:49,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:49,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1302196946, now seen corresponding path program 1 times [2019-01-01 21:52:49,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,288 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-01-01 21:52:51,641 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 21:52:51,667 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:52:51,668 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:52:51,668 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:52:51,668 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:52:51,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:52:51,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:51,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:52:51,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:52:51,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncat-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:52:51,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:52:51,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:52:51,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,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-01 21:52:51,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,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-01 21:52:52,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:52,682 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-01-01 21:52:53,286 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-01 21:52:54,165 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:52:54,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:52:54,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:52:54,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,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-01 21:52:54,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,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-01 21:52:54,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:54,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:54,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:54,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,520 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:52:54,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,528 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:52:54,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:54,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:54,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:54,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:54,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:54,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:54,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:54,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:54,709 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:52:54,765 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:52:54,765 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:52:54,773 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:52:54,774 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:52:54,775 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:52:54,775 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrncat_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrncat_~d~0.offset Supporting invariants [] [2019-01-01 21:52:55,011 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:52:55,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:52:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:55,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:55,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:55,270 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:52:55,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2019-01-01 21:52:55,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 9 states. [2019-01-01 21:52:55,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:52:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2019-01-01 21:52:55,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:52:55,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:55,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:52:55,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:55,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:52:55,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:55,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2019-01-01 21:52:55,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:52:55,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2019-01-01 21:52:55,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:52:55,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:52:55,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:52:55,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:52:55,460 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:55,460 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:55,460 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:52:55,460 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:52:55,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:52:55,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:52:55,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:52:55,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:52:55 BoogieIcfgContainer [2019-01-01 21:52:55,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:52:55,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:52:55,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:52:55,468 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:52:55,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:49" (3/4) ... [2019-01-01 21:52:55,474 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:52:55,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:52:55,475 INFO L168 Benchmark]: Toolchain (without parser) took 7375.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -111.2 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:55,476 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:55,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:55,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:55,480 INFO L168 Benchmark]: Boogie Preprocessor took 43.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:52:55,480 INFO L168 Benchmark]: RCFGBuilder took 534.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:55,482 INFO L168 Benchmark]: BuchiAutomizer took 6086.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -211.8 kB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:52:55,483 INFO L168 Benchmark]: Witness Printer took 5.76 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-01 21:52:55,488 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.16 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 639.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 534.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6086.41 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -211.8 kB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.76 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * d and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 21 SDslu, 19 SDs, 0 SdLazy, 17 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital215 mio100 ax108 hnf98 lsp89 ukn78 mio100 lsp42 div157 bol100 ite100 ukn100 eq169 hnf72 smp94 dnf219 smp97 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 105ms VariablesStem: 11 VariablesLoop: 4 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...